UGC NET CSE | December 2014 | Part 3 | Question: 36

Question

Suppose that we have numbers between $1$ and $1000$ in a binary search tree and we want to search for the number $365$. Which of the following sequences could not be the sequence of nodes examined ?

• A. $4, 254, 403, 400, 332, 346, 399, 365$
• B. $926, 222, 913, 246, 900, 260, 364, 365$
• C. $927, 204,913, 242, 914, 247, 365$
• D. $4, 401, 389, 221, 268, 384, 383, 280, 365$ 

Comments

C is the answer???

---

In the option C---after insertion of node 914 BST is

but 914 is >913 but is is left of root node(913),it is violating BST property.

---

option c is the right answer.

Answer 1

clearly we can see  option (c) is wrong

Answer 2

option C

Answer 3

ans is c as in option c, 914 can not be travelled after 913