Register

Min heap
closed

• edited by
872 views
2 2 votes
closed with the note: Duplicate: https://gateoverflow.in/114128/min-heap

how to solve this please explain procedure... 

Q. 33 A min heap having 1024 distinct elements with keys ranging from 0 to 1023 is stored in array of 1024 indices. The maximum difference between the keys of all the element that can possibly be stored at $\left(\frac{n}{2}\right)$ in index of the array is $\qquad$ .

Not Attempt
Correct Ans.
1014
Video Schution
FAO?
Have any doubt?
Solution

Voting & Accepting an answer helps improve the community
← Previous · Higher normal form d...Next → · #gatebook
← Previous in category · True/falseNext in category → · Programming problem ...
Position:
Show:

Related questions

3 3 votes
1 1 answer
963
963 views
Hira Thakur asked Jan 1, 2019
963 views
HEAP (MAX/MIN HEAP)
what is the time complexity of various problems such as:1) Creating the heap2) Getting maximum element in the max heap3) Getting minimum element in the max heap4) Getting...
5 5 votes
0 0 answers
1.2k
1.2k views
vamp_vaibhav asked Dec 29, 2017
1,157 views
Min heap tree
Answer given : 1935360 but I m getting 3225600 please check..
0 0 votes
0 0 answers
2.1k
2.1k views
Shubhanshu asked Oct 18, 2017
2,066 views
Data Structure: Find 7th smallest element in Min heap
In a binary min heap with n elements, the 7th smallest element can be found in _____ ?Answer given is O(logn) and solution:-Delete the 1st smallest element O(logn)Delete ...
5 5 votes
1 answers 1 answer
1.9k
1.9k views
ankitgupta.1729 asked Nov 9, 2017
1,865 views
Heap - Please explain first statement
33. Which of the following statements about max heap are true ?(I) To find the kth largest element in the heap, the time required is $\mathrm{O}(\mathrm{klogn})$, where k...