We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is

#1

why the answer of this question is O(n) NOT log( N)

#2

hello @anshulgurawalia

heap construction takes O(n) right?

so if we have to insert n more elements then first we push all n elements in the heap array . so now net size will be 2n and the we again construct heap from scract so this time it will take O(2N) which is O(N) ONLY

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.