Made Easy Test Series:Data Structure

Question

Assume a Binary Search Tree is not allowed to have duplicates, there is more than one way to delete a node in the tree when the node has two children.If we resolve the situation in favor of choosing element for replacement from left substructure, then which one of the following is true about replacement element?

• A. Largest node in left subtree
• B. Smallest node in right subtree
• C. Both

---

I know it is predecessor node, but can it be successor too ??

“If we resolve the situation in favor of choosing element for replacement from left substructure” what this line exactly means?

Answer 1

I think Left substructure denotes left sub tree

Hence, Option A is correct as Option B involves choosing from Right Subtree