Tree Method: Implicit Heap
A min-heap is a complete binary tree where all child nodes contain larger times than the parent node time.
Given an internal node p with datum x, the heap is organized so that
p.left NIL ? p.x < p.left.x
p.right NIL ? p.x < p.right.x