data strucure

Question

A search was performed on some binary search tree. Which of the following is a valid search sequence?

(A) 1, 11, 111, 98, 58, 78, 90, 48, 88
(B) 333, 33, 53, 93, 63, 90, 70, 88
(C) 8, 888, 18, 98, 38, 78, 90, 48, 88
(D) 555, 5, 55, 95, 45, 65, 75, 88

Answer 1

for the better understanding of insertion of BST, you can refer this: https://www.cs.usfca.edu/~galles/visualization/BST.html

Comments

thanks

Answer 2

option B is correct.

Comments

48 is less than 58 it should be at left of 58 what is problem here

---

in a valid search sequence we should follow single path.

---

can u define what is valid search sequence when search number is not given with reference if possible