Consider a Binary Search Tree (BST) containing distinct integers from 1 to…

PYQ RSSB Computer Instructor 2026

Consider a Binary Search Tree (BST) containing distinct integers from 1 to 1000. During a search for the key 363, which one of the following sequences cannot occur as the sequence of visited nodes?

  1. A.

    2, 399, 387, 219, 266, 382, 381, 278, 363

  2. B.

    2, 252, 401, 398, 330, 344, 397, 363

  3. C.

    924, 220, 911, 244, 898, 258, 362, 363

  4. D.

    925, 202, 911, 240, 912, 245, 363

  5. E.

    Question not attempted

Attempted by 320 students.

Sign up free to check your answer

Sign up free

Explore the full course: Rssb Senior Computer Instructor

Loading lesson…