• OVERVIEW
• DEFINITIONS
• INVARIANTS
• TRANSFORMATIONS
• OPERATIONS
• STRUCTURE
• VISUALIZATION
• REFERENCE

Due to the size of the container, it's best to insert ≤ 30 nodes, and use 0 ≤ key ≤ 99. For a bigger container, please use Visualization 2
Random Insert: Make a new heap with N random nodes, each with a unique key
Insert: Insert the corresponding key into the heap
Decrease Key: Select a target node by clicking on it in the tree, and enter the final key (should be < current key)
Delete Min: delete the minimum node/root
Merge: Merge the two heaps

Active Root Reduction Ready(part 1) Single Active Roots of Rank x(part 2) Active Nodes with Loss 1(part 3) Loss Reduction Ready(part 4)

Random Insert H1 Random Insert H2   Insert to H1 Insert to H2   Decrease Key   Delete Min H1 Delete Min H2   Merge H1 and H2

---

The analysis on this site is based on Strict Fibonacci Heaps