1,352 views
9 votes
9 votes
The number of min heap trees are possible with 13 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ___

A. 627

B. 747

C. 657

D. 757

2 Answers

Best answer
15 votes
15 votes

The number of min heap trees are possible with 13 elements such that every leaf node must be greater than all non-leaf nodes of the tree are  $_{3}^{5}\textrm{C} \times 2! * 7!$

selected by
0 votes
0 votes

1st  level : 1 node => 1! ways

2nd  level: 2 node => 2! ways

3rd  level : 4 node => 4! ways

4th  level: 6 node => P(8,6) ways

So, number of Min Heaps are = 1!*2!*4!*P(8,6) = 672

Please cross ckeck !

Related questions

0 votes
0 votes
1 answer
2
its_vaibhav asked Jan 13, 2022
281 views
What is the output of the following c-code ? A.It prints the APPLIED B.It prints the DEILPPA C.It prints nothing D.None of the above
0 votes
0 votes
1 answer
3
its_vaibhav asked Jan 12, 2022
594 views
applied gate test seriesWhat is the output of the following c-code[ Note: Assume integer as 2 bytes] ?#include<stdio.h>int main(){ int x = 500;char *p=&x;*++p=2;printf(�...
4 votes
4 votes
1 answer
4
ramakrushna asked Dec 31, 2021
1,337 views
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!