1 1 vote We are given a set of n distinct elements and an unlabelled binary tree with n nodes.how many ways can we populate the tree with the given set so that it becomes a BST 0 1 n! 2nCn / (n+1) Data Structures + – A_i_$_h 1.3k views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments A_i_$_h commented Jun 15, 2017 reply Follow flag Thank you :) 0 0 replyShare A_i_$_h commented Jun 15, 2017 reply Follow flag Sorry..I am new to gate overflow so that's why made some reposts of the earlier ones,will look into it 0 0 replyShare Rupendra Choudhary commented Jun 15, 2017 reply Follow flag Cool. Then it would be a contribution for those 'next' students. 1 1 replyShare Please log in or register to add a comment.
0 0 votes The structure of the Binary tree is given.We cant change that.So only 1 way to organise the BST so 1 Should be the correct answer No_name answered Jun 19, 2017 No_name comment Share Follow 0 reply Please log in or register to add a comment.
