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

[Shreya-Gupta-2383169445069382 (Shreya Gupta)]

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

[sgrarora3 (sagar arora)]

@Shreya-Gupta-2383169445069382 inserting a new element in the binary heap takes the time related to the order of O(Logn), since we are adding n more keys, every addition will take time of the order O(Logn), hence for n new keys the total will be of the order n*O(Logn).
Hope this helps.