Question

What sequence of operations would give the worst case for fibonacci heaps? Where each node has only one child except for the last node?

For example:

5
|
6
|
7
|
8

Answer 1

This is actually the best case (as you can see, extract-min is always easy, since we have the element ordered). You should get it by inserting a sequence of reverse-sorted elements (that is, the minimal element would come last) in this manner:

1. insert two elements
2. extract-min
3. repeat