Consider the following binary search tree diagram: Consider the following addNode method for inserting a newNode into a binary search tree:
public void addNode(Node newNode)
{
int comp = newnode.data.compareTo(data);
if (comp

Question

Consider the following binary search tree diagram:  Consider the following addNode method for inserting a newNode into a binary search tree:
public void addNode(Node newNode)
{
int comp = newnode.data.compareTo(data);
if (comp < 0)
{
if (left == null) {left = newNode;}
else { left.addNode(newNode); }
}
else
{
if (right == null) {right = newNode;}
else { right.addNode(newNode); }
}
}
Which nodes will be visited in order to insert the letter E into this tree, calling addNode on the root of the tree? 
A)H only 
B)H and D only 
C)H, D, and A 
D)H, D, and F

Quizplus · Accepted Answer

To insert the letter E, we compare E with the root node (H) and find that it's less than H, so we move to the left subtree. We compare E with the left child of H (D) and find that it's greater than D, so we move to the right subtree of D. We find that the right child of D (F) is null, so we insert E as the right child of D. Therefore, the nodes visited are H, D, and F.

Consider the Following Binary Search Tree Diagram: Consider the Following