Inserting a new item into a binary heap:
Building a heap by inserting items one at the time
To build a heap with insert routine is straightforward. Just insert one at the time all the items at the end of the heap and lift each inserted item into its correct position.
Exercise: Insert
Insert the stream of keys into an originally empty binary heap. The heap is depicted in binary tree representation even though the implementation is an array starting from index 1 (the root node).
Each record stored into Heap is represented by a key that shows its
priority. You can drag & drop the keys from the array into the heap and
restore heap property after each insertion. If you drag & drop a key in heap on top of another one, the records are swapped, which corresponds to the operations in the "do" loop.
Algorithm 1 MaxHeapInsert(A, key)

This document was last updated 30.5.2011. Please send your comments to Mikko Laakso, Ari Korhonen, and Ville Karavirta.