This demo is designed to show and help you understand operations with a Fibonacci heap. A Fibonacci heap is a collection of heaps that are linked together. The heap property requires each parent node to be no greater than any of its child nodes.
Add a new tree with one element.
Remove the root of the min tree, add all its children to the root list, and consolidate the trees.
If an element becomes less than its parent, move it to the root list.
Remove an element by moving it to the root list and then performing a pop min operation.
Join the root lists of two Fibonacci heaps.
Root node
Min element which is also a root node
Non-root node
Parent-child link
Weak parent-child link