Q3
What is the time complexity of binary search in a balanced binary search tree (BST)?
A.
O(log n)
AnswerB.
O(n)
C.
O(n log n)
D.
O(1)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board