Trees

Fibonacci Heap

A collection of trees with deferred consolidation, useful in graph algorithms.

Learn with an interactive visualization

Category: Trees. Complexity: Insert O(1) · Extract min. O(log n) amort..

A collection of trees with deferred consolidation, useful in graph algorithms. Interactive visualization, Java and C++ code, operations, complexity, and a…