Consider the Following Binary Search Tree Diagram: Consider the Following

Multiple Choice

Consider the following binary search tree diagram: Consider the following pseudocode for the removal of a node n in a binary search tree:


If node Y is to be removed, which action should be taken?

A) Modify V's right reference to point to X.
B) Modify V to have a null right pointer.
C) Modify V's left reference to point to X.
D) Swap the values in V and X, and modify X's right reference to point to V.