Locating an element in a balanced binary search tree takes ____ time. A)O(1) B)O(log(n)) C)O(n²) D)O(n)

Question

Quizplus · Accepted Answer

In a balanced binary search tree, the height of the tree is logarithmic with respect to the number of nodes, therefore locating an element takes O(log(n)) time. Option A is incorrect because O(1) time complexity applies to array or hash table lookups where the index of the element is known. Option C is unintelligible and incorrect. Option D is incorrect because a balanced binary search tree does not take O(n) time for lookup.

Locating an Element in a Balanced Binary Search Tree Takes