Heapsort: Heaps
Geometrically, a heap is an “almost complete” binary tree.
Vertices must be added one level at a time from right to left.
Leaves must be on the lowest or second lowest level.
All vertices, except one must have either zero or two children.