Consider a Binary Search Tree (BST) containing distinct integers from 1 to…
RSSB Computer Instructor · 2026 recruitment · Senior Computer Instructor · Paper II
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?
- A.
2, 399, 387, 219, 266, 382, 381, 278, 363
- B.
2, 252, 401, 398, 330, 344, 397, 363
- C.
924, 220, 911, 244, 898, 258, 362, 363
- D.
925, 202, 911, 240, 912, 245, 363
- E.
Question not attempted
Attempted by 40 students.
Sign up free to check your answer
Sign up freeLoading lesson…