A Fibonacci heap has a minimum node, usually at the root of a tree containing a minimum key. The roots of all trees are usually linked using a circular, doubly linked list called the root list.
The Fibonacci heap's potential performance to do operations is given by
where t is the number of trees in the root list of a Fibonacci heap, and m is the number of marked nodes.
Search Encyclopedia
