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.
5 votes 5 votes The Constructed Binary Search Tree from the given Elements will be Clearly, the element in the lowest level in the above BST is 67. So, Option B is True. SarathBaswa answered Jul 4, 2020 SarathBaswa comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes First elelment is root then insert elements as 1.smaller elements then node should be on Left Subtree of that node this is true for every node. 2.Larger elements then node should be on Right Subtree of that node this is true for every node. Courtesy: GeekForGeeks Insert(Root,key) { if(Root is NULL) Create a Node with value as key and return Else if(Root.key >= key) Insert(Root.left,key) Else Insert(Root.right,key) } Musa answered Aug 18, 2020 Musa comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes See the question carefully... in the sequence shown, the element in the lowest level is.. I don’t know but why everybody is talking about last level even in the best answer. In the question it is saying about lowest level and in the given. It basically means asking about 1st level node. here the level 1 or height 0 contains element is 67. which is our answer Option- B REF – What is the difference between tree depth and height? Kiyoshi answered Apr 25, 2021 Kiyoshi comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes https://youtu.be/FTlgB1YYhDo rohittulasyan answered Oct 11, 2018 rohittulasyan comment Share Follow See all 0 reply Please log in or register to add a comment.