When an Application Begins Searching a Binary Search Tree, It

Multiple Choice

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