GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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(nLogn)

B

O(nLogLogn)

C

O(n)

D

O(nLogn)

asked in data structures and algorithms by gate

1 Answer

0 votes
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.
answered by gate

Related questions

The best answer to any question