6,662 views
4 votes
4 votes

How many different binary search trees can be constructed using six distinct keys?

  1.   256
  2.   128
  3.   132
  4.   264

4 Answers

3 votes
3 votes
We use the catalan number Cn = (2n)!/ (n+1)!*n! to find the number of binary search tree with n vertices.

So in this case n = 6,

Hence 12!/7!*6! = 132
0 votes
0 votes
Get the no. of bst's possible with 'n' nodes

                                          2nCn/n+1 (Catalyn no.)

Related questions

6 votes
6 votes
3 answers
3
air1ankit asked Mar 9, 2017
1,588 views
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*)Hint - if lenear search is possi...