``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