D(n) = upper bound on degree of a node in a Fibonacci Heap with n nodes
By showing D(n) = O(lg n), we can constrain running times for node removal.
1. Make node root 2. Delete 3. Add O(lg n) children to root list