To maintain the completeness of the tree, there is only one valid element to replace the root, and that is the element stored in the first leaf in the tree.

Question

Quizplus · Accepted Answer

In binary search trees, the root can be replaced by either the largest element in the left subtree or the smallest element in the right subtree to maintain the tree's properties, not just the first leaf.

To Maintain the Completeness of the Tree, There Is Only