recategorized by
831 views
3 votes
3 votes

I have doubt when its asked to know number of labelled and unlabelled binary tree :

For labelled = (On basis of labelling)

 T(n) = 2nCn/(n+1) * n!

For unlabelled = (On Basis of Geometric Sturucture)

T(n) = (2n)Cn/n+1

Right?

What if its Asked for BST what will be the answer in both the above cases and Why?

recategorized by

1 Answer

0 votes
0 votes
since, u have metioned that u need no of binary search tree definitely u must have unique searching sequence , so there will be only one bst for given sequence , and also keep in mind bst is always drawn for values which is comparable among each other thats why we have only one bst for given sequence.

Related questions

1 votes
1 votes
0 answers
1
Nandkishor3939 asked Jan 25, 2019
634 views
I think its answer is 8 .Please ,can any one make it sure for me :)
0 votes
0 votes
1 answer
2
Prince Sindhiya asked Jan 2, 2019
705 views
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
2 votes
2 votes
3 answers
3
4 votes
4 votes
2 answers
4
Parth Shah asked Dec 11, 2018
1,386 views
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is?A)C-A-BB)A-...