Q16
In a Binary Search Tree (BST), what is the time complexity of searching for an element in the worst case?
A.
O(1)
B.
O(log n)
C.
O(n)
AnswerD.
O(n log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board