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 D is to be removed, which action should be taken?

A) Swap the values in C and D so that C has A as its left child, then remove the new D node.
B) Modify K to point to A as its left child, and modify A to point to F as its right child.
C) Modify K to make its left child null.
D) Modify K to point to F as its left child and modify F to point to A as its left child.