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
O(logN)
O(N)
O(NlogN)
O(N^2)
according to me the answer should be O(NlogN) as
2^h elements i.e. n elements can be inserted at height h , with complexity logn , which makes it is n * logn
Yes, I also think it should be n log n
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.