While inserting the elements 71, 56, 48, 96, 76, 82, 98 in an empty binary search tree in the sequence shown, which element will come in the lowest level?
Show answerHide answer
Correct answer: (D) 82
Explanation
71 is the root; 56 and 48 go left; 96 goes right; 76 becomes the left child of 96; 82 goes right of 76 (level 4); 98 is the right child of 96. So 82 is at the deepest level.