1procedure insert(heap, value)
2 create new node with value
3 add node to root list
4 update min pointer if needed
5procedure extractMin(heap)
6 z ← min node
7 add children of z to root list
8 remove z from root list
9 consolidate()
10procedure consolidate()
11 for each node w in root list
12 while A[w.degree] exists
13 link trees of same degree
14 update min pointer
15procedure decreaseKey(node, newKey)
16 node.key ← newKey
17 if node.key < parent.key: cut and cascading cut