in what best time complexity we can merge two heap of different sizes (first heap size is (m+n) and second size is n)
Doubt related heap
@Mansi,
Since time complexity for building the heap from array of n elements is O(n). The complexity of merging the heaps is equal to O(n + m).
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.