Search:

These answers are not in any particular order, so couldn't they ALL be binary search trees, once correctly put into a BST?

Suppose that a certain BST has keys that are integers between 1 and 10, and we search for 5. Which sequence below cannot be the sequence of keys examined?

(a) 10,9,8,7,6,5
(b) 4,10, 8, 6, 5 ...