Consider the Following Binary Search Tree Diagram: If Node

Multiple Choice

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.