Assume we have the following heap.
Removing the minimal element takes the following steps.
Inserting an element with key 8 takes the following steps.
Implementation of a priority queue with a heap in pseudocode: PostScript and PDF
Dictionary, find the keys which occur more than once in the