Consider the following binary search tree diagram: If node Y is to be removed, which action should be taken? Use the technique presented in the textbook.
A) Modify the V's left reference to point to X.
B) Modify the V's right reference to point to X.
C) Swap the values in V and X, and modify X's right reference to point to V.
D) Modify V to have a null right pointer.

Question

Consider the following binary search tree diagram:  If node Y is to be removed, which action should be taken? Use the technique presented in the textbook.
A) Modify the V's left reference to point to X. 
B) Modify the V's right reference to point to X. 
C) Swap the values in V and X, and modify X's right reference to point to V. 
D) Modify V to have a null right pointer.

Quizplus · Accepted Answer

Node Y has a single child node, Node X. In order to remove Node Y, Node V must be modified to point to the child node X instead of Y. Since X is greater than V, the right reference of V should be updated to point to X. So, choice B is the correct action to take.

Consider the Following Binary Search Tree Diagram: If Node