Total number of ordering possible with 12,10,8,5,3,2,1,7,9 such that if node of the below graph is filled with given elements , such that it satisfy MAX-Heap property
How to solve such question accurately
$\frac{9!}{9*5*3*3*1*1*1*1*1}=896$
follow this he derived this formula beautifully.
@Shubhgupta
Can you share exact time in video its 1hr video
@ShubhguptaBut why isn't 2018 question following this logic as for that also we could have only 1 structure but the ans for it is 80
just check the beautiful explanation by KAPIL sir https://gateoverflow.in/102171
if you have still doubt then comment !
@Markzuck
it is working for 2018 examples also they asked # of min heaps ..so we have to consider CBT structure with 7 nodes
O
O O
O O O O
7! / 7*3*3*1*1*1*1 = 80
https://gateoverflow.in/199006/max-heap-counting