AlgoScope

Fibonacci Heap Decrease-Key

Cut the node to the root list. Cascading cuts keep the potential bounded.

Heap algorithms, algorithm, expert
Decreased to 9: Below its parent: cut it to the root list and mark the parent.heap23915301952

Binomial and Fibonacci Heaps: Decrease-key: one cut

Decision, step 2 of 4

41 becomes 9. Its parent is 23, which is now larger: heap order is broken between exactly these two nodes, so 9 is cut and joins the root list, and the parent takes a mark.

How binomial and fibonacci heaps works

Cost

Best
O(1)
Average
O(1) amortized
Worst
O(log n)
Space
O(1)

Taught by the same lesson

Binomial and Fibonacci Heaps covers these too, in the same run.