251 views
1 votes
1 votes
What is the total no. Of binary tree possible with n nodes? How one can calculate?

1 Answer

1 votes
1 votes
It is nothing but counting number of unique structure possible

If we are talking about unlabled binary tree then there is formula for it $\frac{1}{n+1}^{2n}\mathbb{C}_{n}$

If we take n= 2 we get 2 unique structure

For n=3 fine unique structure

And. Labled binary search tree would be =$\frac{1}{n+1}^{2n}\mathbb{C}_{n}*n!$

Related questions

0 votes
0 votes
1 answer
1
Chaitanya Kale asked Aug 31, 2022
438 views
In GATE if questions just mention a tree then should we assume it to be a directed or undirected tree?Also, if we are having an undirected tree then does the child node c...
3 votes
3 votes
5 answers
2
srestha asked May 22, 2019
1,852 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
3
sripo asked Jan 16, 2019
6,826 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
1 answer
4
suneetha asked Nov 2, 2018
416 views
formula for which maximum number of nodes will be present in complete n-array tree?