1 votes 1 votes 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) A_i_$_h asked Jun 14, 2017 A_i_$_h 246 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes Inorder Travesal of BST is unique so you can have only one arrangement which gives you that order.so there is only one way you can populate the tree. junaid ahmad answered Jun 16, 2017 junaid ahmad comment Share Follow See all 0 reply Please log in or register to add a comment.