Binomial heap

• More efficient merge operation
• Extract-min: delete root, merge
• Insert: add single node, merge
• Decrease-key: swim up whole sub-tree
• Delete: decrease-key (-∞), then extract-min