Suppose that we have k max heaps, with n items in each. We wish to combine these into a single max heap with n * k items in it. Each of the following parts 7a and 7b describes one approach to combining the heaps, for which you are asked to derive the worst case big O running time. Required:
Create a new, empty heap H. For each of the k heaps, we repeatedly remove the highest priority element and insert it into H, until the original heap is empty. What is the worst-case big O running time?