A binary search tree is searched for the key 43. Select all probe sequences…
A binary search tree is searched for the key 43. Select all probe sequences that can occur, in order, during a BST search for 43. Assume that all keys are distinct.
- A.
61 52 14 17 40 43
- B.
2 3 50 40 60 43
- C.
10 65 31 48 37 43
- D.
81 61 52 14 41 43
- E.
17 77 27 66 18 43
Attempted by 62 students.
Sign up free to check your answer
Sign up freeLoading lesson…