Register

Heaps-GATE-doubt

378 views
0 votes
0 votes

https://gateoverflow.in/459/gate2008-47
here if we insert all elements together and then call heapify function then it’ll take O(logn) time. why answer is O(n)?

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
iarnav asked Jun 21, 2018
470 views
#DataStructure Heaps Self Doubt.
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 smallest or largest, but simply the 99th element.
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 ...
User Avatar
7 votes
7 votes
2 answers
3
Warlock lord asked Dec 5, 2017
1,153 views
Heaps
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 heap of size n. 2. A max heap of size k. 3. A min heap of size n. 4.A min heap of size k.
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 ...
User Avatar
Link Copied!