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.
Correct Answer:

Verified
Correct Answer:
Verified
Q98: Given the BinarySearchTree and Node classes discussed
Q99: Consider the following binary search tree diagram:
Q100: Given the MinHeap class discussed in section
Q101: Which of the following is NOT a
Q102: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q104: Consider the following binary search tree diagram:
Q105: A binary tree of height h can
Q106: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q107: A binary search tree is made up
Q108: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"