Register

Heaps

596 views
0 0 votes
What is the complexity of finding 100th smallest element from a min-heap

a) ϴ(1)                                              b) ϴ(logn)

c) ϴ(n)                                              d) ϴ(nlogn)

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · #operating systemNext → · Doubt in some basic ...
← Previous in category · #algoNext in category → · #algorithm
Position:
Show:

Related questions

1 1 vote
1 1 answer
515
515 views
air1air2 asked Dec 8, 2024
515 views
heaps
0 0 votes
0 0 answers
689
689 views
aditi19 asked Dec 4, 2018
689 views
Heaps-GATE-doubt
https://gateoverflow.in/459/gate2008-47here if we insert all elements together and then call heapify function then it’ll take O(logn) time. why answer is O(n)?
1 1 vote
0 0 answers
3.0k
3.0k views
Lakshman Bhaiya asked Nov 1, 2018
3,032 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...
7 7 votes
2 2 answers
2.9k
2.9k views
Warlock lord asked Dec 5, 2017
2,917 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 ...