next up previous
Next: Up: Previous:

Fibonacci Heaps


Procedure Binomial Heap Fibonacci Heap
  (worst case) (amortized)
Make-Heap $\Theta(1)$ $\Theta(1)$
Insert $O(\lg n)$ $\Theta(1)$
Minimum $\Theta(lgn)$ $\Theta(1)$
Extract-Min $\Theta(lgn)$ $O(\lg n)$
Union $O(\lg n)$ $\Theta(1)$
Decrease-Key $\Theta(lgn)$ $\Theta(1)$
Delete $\Theta(lgn)$ $O(\lg n)$




next up previous
Next: Up: Previous: