Consider the following binary search tree diagram: Which nodes will be visited in order to insert the letter E into this tree?
A) H
B) H and D
C) H, D, and F
D) H, D, and A

Question

Consider the following binary search tree diagram:  Which nodes will be visited in order to insert the letter E into this tree?
A) H 
B) H and D 
C) H, D, and F 
D) H, D, and A

Quizplus · Accepted Answer

We start at the root node, H, which has a value of G. Since E is greater than G, we move to the right subtree, which brings us to the node with value of D. Since E is greater than D, we move to the right subtree again, which brings us to the node with value of F. Since F does not have a right child, we insert E as its right child. Therefore, nodes H, D, and F will be visited in that order.

Consider the Following Binary Search Tree Diagram: Which Nodes