664 views

1 Answer

0 votes
0 votes
$5$ distinct nodes means you can uniquely identify each node based on some parameter say a key value, Then the solution to this problem is given by bell's number.

Number of binary trees possible $= \binom {2n}{n}*n!$

Related questions

1 votes
1 votes
0 answers
3
Rohit Gupta 8 asked Dec 25, 2017
1,142 views
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
0 votes
0 votes
2 answers
4
Aman Bisht asked Jun 12, 2017
1,121 views
The height of a binary tree having 'i' nodes at level 'i' considering root to be at level 1 is . where 'n' is the total no of nodes in the tree.A. O(logn)B. O(n)C. O(R...