Q30
What is the typical time complexity of accessing an element in a Binary Search Tree (BST) in the best case?
A.
O(1)
B.
O(log n)
AnswerC.
O(n)
D.
O(n log n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board