Searching a binary search tree is a(n) ____ process. A) O(n) B) O(log n) C) O(1) D) O(log₂n)

Name: Searching a binary search tree is a(n) ____ process. A) O(n) B) O(log n) C) O(1) D) O(log 2 n)
Brand: Quizplus
Rating: 4.7 (37 reviews)

Question

Quizplus · Accepted Answer

Binary search trees are designed in such a way that each comparison allows the operations to skip about half of the tree, so that each lookup, insertion, or deletion takes time proportional to the logarithm of the number of items stored in the tree. This is why the average time complexity is O(log n).

Searching a Binary Search Tree Is A(n) ____ Process