堆, 优先队列,可以用来排序,计算top k问题
heap property:
In a max-heap, the max-heap property is that for every node i other than the root, A[parent([i)] >= A[i]. That is, the value of the node is at most the value of its parent. Thus the largest element is stored at the root.
binary heap: like a complete binary tree.
interface: