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 J is to be removed, to which node will H point to instead of J?
A)X
B)N
C)M

Question

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 J is to be removed, to which node will H point to instead of J? 
A)X 
B)N 
C)M

Quizplus · Accepted Answer

Based on the pseudocode, when a node is removed, its right subtree will be attached to the node that replaces it. In this case, node J's right subtree is node M. Therefore, node H should point to node M instead of J.

Consider the Following Binary Search Tree Diagram: Consider the Following