When an application begins searching a binary search tree, it starts at
A) the outermost leaf node.
B) the middle node, halfway between the root and the longest branch.
C) the root node.
D) the rightmost child of the root node.
E) None of the above

Question

Quizplus · Accepted Answer

When an application begins searching a binary search tree, it always starts from the root node which is the topmost node in the tree. This is because the root node has access to all other nodes in the tree, and searching from the root node ensures that all other nodes are visited properly. Therefore, option C is the best choice for this question.

When an Application Begins Searching a Binary Search Tree, It