1 votes 1 votes The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.] Programming in C binary-search-tree combinatory + – Mr_22B asked Dec 10, 2017 Mr_22B 388 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ashwin Kulkarni commented Dec 10, 2017 reply Follow Share 26 ways! = 64 ways 1 votes 1 votes Ashwani Kumar 2 commented Dec 10, 2017 reply Follow Share Similar to this https://gateoverflow.in/39586/gate2016-2-40 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes We have 7 levels to fill up If root node is fixed then at each level we have two choices either left subtree or right subtree. hence by skipping root we have, 26 choices. = 64 ways. Ashwin Kulkarni answered Dec 10, 2017 Ashwin Kulkarni comment Share Follow See all 0 reply Please log in or register to add a comment.