0 0 votes 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? Largest node in left subtree Smallest node in right subtree 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? Data Structures data-structures made-easy-test-series + – srestha 1.7k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes I think Left substructure denotes left sub tree Hence, Option A is correct as Option B involves choosing from Right Subtree Spandan350 answered Jul 15, 2019 Spandan350 comment Share Follow 0 reply Please log in or register to add a comment.