Heaps MCQ - Merge 2 max-heaps
How is the answer O(1) ?
According to me it should be O(m+n) or say O(m+2n) by the approach that first we form an array of all the elements of the heap…and then we build the new heap using the array and heapify method…
Knowing that the time complexity to build a heap from an array with N elements is O(N) in best case…so for (m+n)+n elements, it should be O(m+2n)