In a Binary Search Tree (BST) with n nodes and height h, what is the…

PYQ RSSB Computer Instructor 2026

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?

  1. A.

    O(n2)

  2. B.

    O(1)

  3. C.

    O(log n)

  4. D.

    O(h)

  5. E.

    Question not attempted

Attempted by 615 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…