25 votes 25 votes 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 $65$ $67$ $69$ $83$ DS gatecse-2015-set3 data-structures binary-search-tree easy + – go_editor asked Feb 14, 2015 • edited Dec 21, 2017 by kenzou go_editor 7.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 38 votes 38 votes On last level $67$, hence option $B$ is True. Bran Stark answered Feb 27, 2015 • edited Jun 13, 2018 by Milicevic3306 Bran Stark comment Share Follow See all 0 reply Please log in or register to add a comment.
12 votes 12 votes option B.... 67 because it is on level 3 and 83 is on level2 Anoop Sonkar answered Feb 14, 2015 Anoop Sonkar comment Share Follow See all 0 reply Please log in or register to add a comment.
7 votes 7 votes B. 67 is true. Element 67 will be on level 3 i.e., last level of this tree. vishalgarg837 answered Nov 24, 2015 vishalgarg837 comment Share Follow See all 0 reply Please log in or register to add a comment.
5 votes 5 votes B. 67 (At Level 3) rpdhakad answered Jul 13, 2015 rpdhakad comment Share Follow See all 0 reply Please log in or register to add a comment.