Since inserts are immediately followed by a delete, both are combined and processed together: If the insert item is smaller than the item at the root, the processor returns with the insert item itself for the subsequent think phase leaving the heap intact. Else, the root item is deleted, and the insert item is used as the substitute item to update the heap. Same strategy can also be employed for serial heap. Readers are referred to for further details.