Make-Heap, Insert, Minimum, Extract-Min, Union
These always yield unordered binomial trees; thus, they maintain the binomial
For n-node Fibonacci Heap, D(n) is largest if all nodes are in one tree.
The maximum degree is at depth=1,
= k for tree with
If n = 2k, then k = lg n