Q190
Balanced binary tree with n items allows the lookup of an item in . . . . . . . . worst-case time.
A.
O(log n)
AnswerB.
O(nlog 2)
C.
O(n)
D.
O(1)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board