Asymptotic time complexity of inserting n elements to a binary heap already containing n elements
Asked 2011-11-04T15:22:59.020
8
Suppose we have a binary heap of n elements and wish to insert n more elements(not necessarily one after other). What would be the total time required for this?
I think it's theta (n logn) as one insertion takes logn.