654 views
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)

1 Answer

0 votes
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

Related questions

3 votes
3 votes
5 answers
1
srestha asked May 22, 2019
1,794 views
Consider the following function height, to which pointer to the root node of a binary tree shown below is passedNote that max(a,b) defined by #define max(a,b) (a>b)?a:b.i...
4 votes
4 votes
5 answers
2
sripo asked Jan 16, 2019
6,729 views
Let us there are n nodes which are labelled.Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$Then the binary search trees possi...
0 votes
0 votes
0 answers
3
1 votes
1 votes
2 answers
4