Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

Data Structures | Heap | Question 8

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

In a min-heap with n elements with the smallest element at the root, the 7th smallest element can be found in time:









Answer: (D)


For clarity, assume that there are no duplicates in Min-Heap and accessing heap elements below root is allowed.

The 7th smallest element must be in first 7 levels. Total number of nodes in any Binary Heap in first 7 levels is at most 1 + 2 + 4 + 8 + 16 + 32 + 64 which is a constant. Therefore we can always find 7th smallest element in \\theta(1)   time. If Min-Heap is allowed to have duplicates, then time complexity becomes Θ(Log n). Also, if Min-Heap doesn\’t allow directly accessing elements below root and supports only extract-min() operation, then also time complexity becomes Θ(Log n).

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads
Related Tutorials