Consider the Following Binary Search Tree Diagram: If Node

Multiple Choice

Consider the following binary search tree diagram: If node D is to be removed, which action should be taken? Use the technique presented in the textbook.

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