ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the time complexity of searching for an element in a balanced Binary Search Tree (BST)?
Correct Answer: C — O(log n)
In a balanced BST, the height is O(log n). At each level, we eliminate half the remaining nodes, so search takes O(log n).