Bk structure + heap order + one binomial tree for each height
A priority queue of any size can be uniquely represented by a
collection of binomial trees.
对Binomial Queue可以执行的操作：
删除最小的元素
如何combine两棵树
A binomial queue of N elements can be built by N successive insertions in O(N) time.
