FIBONACCI HEAP — AMORTIZED ANALYSIS
Forest of heap-ordered trees · O(1) amortized insert & decrease-key · O(log n) extract-min
INSERT VALUE
Insert
Extract Min
Decrease Random Key
Clear
Nodes:
0
Trees:
0
Min:
—
Potential Φ:
0
Total ops:
0
OPERATION LOG