388 views
1 votes
1 votes
The number of ways we can insert 11, 12, 13, 14, 15, 16, 17 in empty binary search tree such that resulting tree has the height of 6 = ___________ [height of a tree with single node is 0.]

1 Answer

3 votes
3 votes

We have 7 levels to fill up

If root node is fixed

then at each level we have two choices either left subtree or right subtree.

hence by skipping root we have, 26 choices. = 64 ways.

Related questions

10 votes
10 votes
3 answers
2
ajit asked Oct 1, 2015
10,209 views
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$35$
0 votes
0 votes
1 answer
3
1 votes
1 votes
1 answer
4
talha hashim asked Aug 17, 2018
606 views
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...