254 views
0 votes
0 votes
The number of possible min-heaps containing each value from {1,1,1,1,1,1,1} exactly once is _______

This is a variance of Gate 2018 question and how will we deal if all values are same?

Please log in or register to answer this question.

Related questions

7 votes
7 votes
2 answers
3
Warlock lord asked Dec 5, 2017
1,102 views
From an array of size n , we need to find the k bigger elements. What is the data structure we should use to find k bigger element in best asymptotic complexity? 1.A max ...
0 votes
0 votes
0 answers
4
Balaji Jegan asked Jun 17, 2018
219 views
What is the recurrence relation / math expression for the number of binary min heaps possible with "n" elements on which "k" elements are repeated "t" times where t=2 to ...