In a Binary Search Tree (BST) with n nodes and height h, what is the…
RSSB Computer Instructor · 2026 recruitment · Senior Computer Instructor · Paper II
In a Binary Search Tree (BST) with n nodes and height h, what is the worst-case time complexity of finding the in-order successor of a given node?
- A.
O(n2)
- B.
O(1)
- C.
O(log n)
- D.
O(h)
- E.
Question not attempted
Attempted by 73 students.
Sign up free to check your answer
Sign up freeLoading lesson…