Number of Active/White children
Only defined for Active/White nodes
Undefined for Passive/Red nodes
A special kind of Active/White node -- an Active/White node with Passive/Red parent
e.g. node 2, 7, 8 are active roots
Number of children lost
Similar to marks in a Fibonacci Heap
Active roots always have loss 0
A node where all its children and itself are Passive/Red
All Passive Linkable Nodes are the rightmost children in the tree
e.g. Node 4, 9 are passive linkable nodes
All non-root nodes are maintained in a Queue(Q) with position p
e.g. Node 7 is in position 1, Node 9 is in position 7
Q is used to ensure all nodes have O(logN) degrees. More details in the next section
The analysis on this site is based on Strict Fibonacci Heaps