Data Structures | Heap | Question 11

Given two max heaps of size n each, what is the minimum possible time complexity to make a one max-heap of size from elements of two max heaps?

(A)

O(n^2)

(B)

O(nLogLogn)

(C)

O(n)

(D)

O(nLogn)

Answer: (C)

Explanation:

We can build a heap of 2n elements in O(n) time. Following are the steps. Create an array of size 2n and copy elements of both heaps to this array. Call build heap for the array of size 2n. Build heap operation takes O(n) time.

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

My Personal Notes arrow_drop_up

Save