BST search

Question

Identify the correct sequence for searching 105 in a binary search tree?

a. 500,250,190,220,150,120,105
b. 80,800,500,90,270,280,105
c. 20,30,80,200,90,120,105
d. 30,50,80,200,90,120,105

Plz help me.

Comments

They are asking which of them is correct sequence.

---

ONLY c d

---

Can you please explain only b option why it is correct sequence?

Answer 1

Searching in a BST always starts at the root. We compare a data stored at the root with the key we are searching for. If the node

does not contain the key we proceed either to the left or right child depending upon the comparison. If the result of the comparison is

negative we go to the left child, otherwise - to the right child. 

You need to check the following conditions:

(i) The left sub-tree of a node contains only nodes with keys less than the node's key.

(ii) The right sub-tree of a node contains only nodes with keys greater than the node's key.

Options  C and D are correct sequences for 150.

Comments

I think all  B,C, and D are the correct searching sequence.Why are you saying only C and D right?Please prove your point.

---

In B) 105 is on the right tree of 270.

Is 105>270?

---

yes, Thank you for correcting.