Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons.
A)n
B)n * 3
C)n / 2
D)n - (n / 2)

Name: Locating a particular item in a binary search tree of n nodes requires at most ______ comparisons. A)n B)n * 3 C)n / 2 D)n - (n / 2)
Brand: Quizplus
Rating: 4.9 (32 reviews)

Question

Quizplus · Accepted Answer

In a binary search tree, the maximum number of comparisons required to locate a particular item is equal to the height of the tree. In the worst case, the tree is skewed, making the height equal to n, where n is the number of nodes.

Locating a Particular Item in a Binary Search Tree of N