When deleting the root of a binary search tree, we may find the largest key K from its left subtree,
When deleting the root of a binary search tree, we may find the largest key from its left subtree, and then attach the right subtree of the root to be the right subtree of .
(2分)
