Q197
What are the worst case and average case complexities of a binary search tree?
A.
O(n), O(n)
B.
O(logn), O(logn)
C.
O(logn), O(n)
D.
O(n), O(logn)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board