here if we insert all elements together and then call heapify function then it’ll take O(logn) time. why answer is O(n)?
if you call the Heapify then for n element then it will take = O(n log n) time.
The Solution of this problem is
Take All the 2*n element and call the Build Heap().
So, It will take O(2n) = O(n) time.
@Anmol 300 books will be dispatched this month...