Question
CUET PG Computer Science item 31: What is the worst-case search time in a balanced binary search tree?
Select an option. Your answer will be checked instantly.
Correct Answer: D. O(log n)
Explanation:
Balanced height is logarithmic.
Leave a Reply