While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search…
GATE · 2015 · CS · Set 3 · Computer Science & IT
While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is
- A.
65
- B.
67
- C.
69
- D.
83
Attempted by 789 students.
Sign up free to check your answer
Sign up freeLoading lesson…