Ace Test Series: Data Structures - Heap And Time Complexity

Question

I think its none of the above?

Comments

I think option C ..

---

how is that??

Isnt it mlog(n+m).

---

If it's option C I can tell you my approach..what is the answer given?

---

Given as C

---

Okay..since they said that the elements are not inserted one by one so we can think like all the elements are added together.
Heap uses array data structure right..so append those m elements after n elements.
Now total size of heap is m+n. Apply build heap on it.
You answer would have been correct if the elements were added one by one.

---

Got it now.Thnks :)