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.
Hence Option(C) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
… [Trackback]
[…] Read More Information here to that Topic: geeksforgeeks.org/data-structures-heap-question-11/ […]
… [Trackback]
[…] Find More on to that Topic: geeksforgeeks.org/data-structures-heap-question-11/ […]