Complete n-node binary tree.
All nodes (other than root) satisfy the ``heap property'': .
Example: 1, 3, 7, 9, 10, 9, 14, 15, 13, 16.
.
.
