When deleting the root of a binary search tree, we may find the

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

答案：TRUE