177 views
0 votes
0 votes
How to detect the maximum level and minimum level at which an element of heap can be made to be present?

Suppose a min heap has elements from 1 to 1024 .
Suppose a max heap has elements from 1 to 1024.

Find for : 9, 100, 512. (Both max and min heap, max and min level possible)

Root is at level 1.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Overflow04 asked Jun 29, 2022
2,071 views
Someone please explain the login behind the explanation.
0 votes
0 votes
0 answers
2
iarnav asked Jun 24, 2018
255 views
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 va...
1 votes
1 votes
1 answer
3
iarnav asked Jun 21, 2018
454 views
In a binary Heap of 100 elements time taken to find the 99th element?or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about ...
0 votes
0 votes
0 answers
4
Balaji Jegan asked Jun 17, 2018
220 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 ...