667 views
1 votes
1 votes

The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.

1 Answer

0 votes
0 votes
constrcution will take 0(n) in WC

and 0(logn) in BC

no of unlabeeled Binary trees = no of labelled BST = catalan no

so answer will be 14 anyways.

Related questions

4 votes
4 votes
4 answers
1
Parshu gate asked Nov 27, 2017
6,669 views
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
1 votes
1 votes
0 answers
4
Rohit Gupta 8 asked Dec 25, 2017
1,110 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}))$