search
Log In
1 vote
195 views

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 ________.

in DS
edited by
195 views
0
I am getting a very big number as the answer. Could you please tell the answer?
0
64??
0
no it  is 1935360
0
@Anu007 But Here we have the constraint that "every leaf node must be greater than all non-leaf nodes" Then how could the answer be 21964800?
0
i think in min heap all leaf have greater value than nonleaf.
0
@Anu007 No not necessarily.Consider the min heap 1 2 4 3 5 6 7

Here on the leaf nodes we have 3 5 6 7

1 Answer

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

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