Question

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

Answer 1

Answer:

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