Maintaining the Heap Property

A heap is a dynamic data structure, so we're going to have to contend with changes.

The most important changes can be handled by two basic operations that I call:

These don't change the shape of the tree, just which records are at which nodes.

next up previous
Next: Down-Heapify Up: HEAPS Previous: Representing a Heap