recategorized by
10,207 views

3 Answers

Best answer
10 votes
10 votes

There are 2nCn/(n+1) unlabelled trees possible , now each of these unlabelled trees corresponds to one binary search tree since u have to populate an unlabelled tree with the 4 keys in such a fashion that they satisfy the property of a BST and hence no of BST's=catalan's no 

selected by
Answer:

Related questions

9 votes
9 votes
3 answers
1
go_editor asked Jun 23, 2016
21,466 views
The average depth of a binary search tree is$O(n^{0.5})$$O(n)$$O(\log n)$$O(n \log n)$
4 votes
4 votes
4 answers
2
Isha Gupta asked Jun 15, 2016
7,467 views
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
9 votes
9 votes
7 answers
3
shibu asked Jun 15, 2016
7,350 views
If node A has three siblings and B is parent of A, what is the degree of A?0345
15 votes
15 votes
2 answers
4