UGC NET CSE | December 2010 | Part 2 | Question: 25

Question

Which of the following can be the sequence of nodes examined in binary search tree while searching for key $88$?

• A. $90, 40, 65, 50, 88$
• B. $90, 110, 80, 85, 88$ 
• C. $190, 60, 90, 85, 88$ 
• D. $65, 140, 80, 70, 88$

Comments

Since Given that it is Binary search tree  so if Key< ROOT Goto : LEFT SUB TREE

                                                                       else if key >ROOT goto: RIGHT  SUB TREE

Answer 1

Answer: C

If root node is 190, in order to find 88 we need to traverse the left sub-tree because in the right sub-tree every element will be greater than 190.

Now 88 is greater than 60, so we go to right where we find 90 which is greater than 88, so now we traverse left sub-tree of 90. We find 85 which is less than 88, so we go right and find our key 88.

Comments

Bro can you give it's graphical representation

---

Specify in graph form