Register

Heaps-GATE-doubt

686 views
0 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)?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Ace test seriesNext → · Operating System - F...
← Previous in category · Doubt : ReducibilityNext in category → · doubt regarding NUMB...
Position:
Show:

Related questions

1 1 vote
0 0 answers
3.0k
3.0k views
Lakshman Bhaiya asked Nov 1, 2018
3,017 views
self doubt on heaps
$(1)$ In a binary heap with $'n'$ elements with the smallest element at the root, the $7th$ smallest element can be found in time?$A)\theta(nlogn)$ $B)\theta(n...
1 1 vote
1 answers 1 answer
996
996 views
iarnav asked Jun 21, 2018
996 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 ...
1 1 vote
1 1 answer
514
514 views
air1air2 asked Dec 8, 2024
514 views
heaps
7 7 votes
2 2 answers
2.9k
2.9k views
Warlock lord asked Dec 5, 2017
2,913 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 ...