Choose the operation contract that each queue actually supports, then check what happens at a merge, redistribution, or stale entry.
Lessons
- Pairing heaps: meld roots and pair children on removal
- Binomial heaps: carry equal-degree trees during merge
- Radix heaps: queue nondecreasing integer priorities
- Double-ended queues: reconcile min and max heaps
