Heaps quizz doubt

#1

In what best time complexity you can merge two max-heaps? (Assume size of first heap is (m+n) and the second is (n))

ans= O(1) how?

For deleting any arbitrary element from a min heap in what best complexity you can achieve this?

ans = O(n) how?? should it be O(logn)

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

ans = O(n) how? each element takes logn time insertion so shouldn’t ans be nlogn

Time taken in decreasing the node value in a binomial heap is

ans = logn first we have to find the no which takes O(n) so how logn

plzz clear my doubts?

#2

plz clear my doubts ??

#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.