Heap data structure (source code)

= Heap data structure

= Heap
{synonym}

A tree-based <data structure> that orders each parent relative to its children so that an extremal value is available at the root. In a <max-heap>, every parent is at least as large as its children. Heap implementations provide one way to realize a <priority queue>; the abstract queue and its implementing structure are distinct concepts.