Back to Heap Data Structures
Fibonacci Heap Visualization
Root-list based heap with lazy structure updates and consolidation on extract-min.
Root List Visualization
Current Root List
Heap is empty
Current Step
Select an operation to begin visualization.
Complexity (Amortized)
O(1)
Insert
O(1)
Peek Min
O(log n)
Extract Min
Heap Stats (Current View)
0
Root Trees
-
Current Minimum
Key Properties
Insert adds a singleton tree to the root list.
Extract-min promotes children then consolidates by degree.
Linking always keeps the smaller key as parent.