Skip to content
Related Articles

Related Articles

Improve Article

Data Structures | Heap | Question 7

  • Difficulty Level : Hard
  • Last Updated : 28 Jun, 2021
Geek Week

We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is
(A) \theta(logn)
(B) \theta(n)
(C) \theta(nlogn)
(D) \theta(n^2)
(A) A
(B) B
(C) C
(D) D

Answer: (B)

Explanation: We can reduce the problem to Build Heap for 2n elements. Time taken for build heap is O(n)

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :