edited by
732 views
1 votes
1 votes

The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.

edited by

1 Answer

0 votes
0 votes
for root and leaf nodes it is fixed.

for remaining 6 nodes we have 6C3*2*2

total=8!*6C3*2*2

=3225600

Related questions

5 votes
5 votes
2 answers
1
Utkarsh Joshi asked Nov 24, 2018
3,446 views
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
1 votes
1 votes
1 answer
2
1 votes
1 votes
1 answer
3
Lucky sunda asked Jan 8, 2017
597 views
It should be 5 according to me.Pleas explain if they are correct.
1 votes
1 votes
0 answers
4