0 votes 0 votes Can someone explain how to solve such a problem? DS algorithms data-structures binary-search-tree made-easy-test-series + – Kalpataru Bose asked Dec 26, 2017 edited Mar 7, 2019 by Aditi Singh Kalpataru Bose 407 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply srivivek95 commented Dec 26, 2017 reply Follow Share Sum of leaf nodes=2+15+27=44 1 votes 1 votes Kalpataru Bose commented Dec 26, 2017 reply Follow Share how did you know that we had to start from 26 and not 2 or others?? 0 votes 0 votes srivivek95 commented Dec 26, 2017 reply Follow Share The structure for the resultant tree is given. We need the value at the root which is less than two other values (i.e 26 which is less than 27 & 42) 0 votes 0 votes pawan kumarln commented Dec 26, 2017 reply Follow Share ascending order of given sequence will give in order of BST and u have structure given so u can just see 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Simple way to answer that question is label empty slot by A,B,C,D.... get the inorder of them. Sort the given list and compare element wise, and add up leafs. Dhawal S 1 answered Dec 18, 2018 Dhawal S 1 comment Share Follow See all 0 reply Please log in or register to add a comment.