AntInLoop

Fibonacci Heap Data Structure Interactive Visualizer

A Fibonacci Heap is a lazy mergeable priority queue using circular doubly linked root lists and cascading cuts to achieve O(1) amortized insert, merge, and decrease-key, and O(log n) amortized extract-min.

Read Fibonacci Heap Data Structure Complexity Guide ยท View Code Implementations