+1 vote
in Data Structures & Algorithms I by (110k points)
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.

(a) O(log n)

(b) O(nlog 2)

(c) O(n)

(d) O(1)

My enquiry is from Binary Trees in division Binary Trees of Data Structures & Algorithms I

I had been asked this question in quiz.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct answer is (a) O(log n)

Easiest explanation - Searching an item in balanced binary is fast and worst-case time complexity of the search is O(log n).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...