Another go at Fibonacci heaps today. We started with the invariants of a Binomial heap as a base to get us started on the invariants of a Fibonacci heap.
We discussed cuts in a Fibonacci heap, and the maximum number of nodes we could cut from a tree so that we don’t have to meld. This is important because we want exponential growth in the trees and we want to keep the rank of each root the same because otherwise we wouldn’t have at most one tree of every rank.
Shout out to Marla for providing us with colored chalk and an exam problem.