Given n, how many distinct Max Heap can be made from n distinct integers?
Input : n = 3 Output : Assume the integers are 1, 2, 3. Then the 2 possible max heaps are: 3 / \ 1 2 3 / \ 2 1 Input : n = 4 Output : Assume the integers are 1, 2, 3, 4. Then the 3 possible max heaps are: 4 / \ 3 2 / 1 4 / \ 2 3 / 1 4 / \ 3 1 / 2
Since there is only one element as the root, it must be the largest number. Now we have n-1 remaining elements. The main observation here is that because of the max heap properties, the structure of the heap nodes will remain the same in all instances, but only the values in the nodes will change.
Assume there are l elements in the left sub-tree and r elements in the right sub-tree. Now for the root, l + r = n-1. From this we can see that we can choose any l of the remaining n-1 elements for the left sub-tree as they are all smaller than the root.
We know the there are ways to do this. Next for each instance of these, we can have many heaps with l elements and for each of those we can have many heaps with r elements. Thus we can consider them as subproblems and recur for the final answer as:
T(n) = * T(L) * T(R).
Now we have to find the values for l and r for a given n. We know that the height of the heap h = . Also the maximum number of elements that can be present in the h th level of any heap, m = , where the root is at the 0th level. Moreover the number of elements actually present in the last level of the heap p = n – ( – 1). (since number of nodes present till the penultimate level). Thus, there can be two cases: when the last level is more than or equal to half-filled:
l = – 1, if p >= m / 2
(or) the last level is less than half-filled:
l = – 1 – ((m / 2) – p), if p < m / 2
(we get – 1 here because left subtree has nodes.
From this we can also say that r = n – l – 1.
We can use the dynamic programming approach discussed in this post here to find the values of . Similarly if we look at the recursion tree for the optimal substructure recurrence formed above, we can see that it also has overlapping subproblems property, hence can be solved using dynamic programming:
T(7) / \ T(3) T(3) / \ / \ T(1) T(1) T(1) T(1)
Following is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Convert min Heap to max Heap
- Heap Sort for decreasing order using min heap
- Number of ways to form an array with distinct adjacent elements
- Find number of ways to form sets from N distinct things with no set of size A or B
- Ways to form an array having integers in given range such that total sum is divisible by 2
- Number of distinct ways to represent a number as sum of K unique primes
- Count ways to express even number ‘n’ as sum of even integers
- Number of ways to write N as a sum of K non-negative integers
- Number of ways to paint a tree of N nodes with K distinct colors with given conditions
- Count the number of ways to fill K boxes with N distinct items
- Median in a stream of integers (running integers)
- Minimum product of k integers in an array of positive Integers
- Ways to write n as sum of two or more positive integers
- Count ways to express 'n' as sum of odd integers
- Different ways to represent N as sum of K non-zero integers
- Ways to write N as sum of two or more positive integers | Set-2
- Count permutations of all integers upto N that can form an acyclic graph based on given conditions
- Count ways to partition a string such that both parts have equal distinct characters
- Count ways to split N! into two distinct co-prime factors
- Maximise the number of toys that can be purchased with amount K using min Heap
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.