next up previous contents
Next: Array Heaps: Percolate Up Up: 3240 Previous: Closed (Array) Hashing   Contents

Heap/Priority Queue: ADT [117]


\begin{picture}(708,348)(6,486)
\thicklines\put(100,700){\circle{28}}
\put(140,7...
...t(550,495){\makebox(0,0)[lb]{\raisebox{0pt}[0pt][0pt]{\twlrm 31}}}
\end{picture}

``Heap'' is a binary tree

Each ``interior'' node has two children (except ?)

Each child's value is greater (or equal) to the parent

Minimum value is always at the root

``Percolate Up'' a new value 14



Subsections

Ted Billard 2001-10-25