Binomial heaps are a simple and flexible priority queue structure that supports efficient melding of priority queues. The intuition behind binomial heaps is particularly elegant, and these heaps will serve as a building block toward the more complex Fibonacci heap data structure that we'll talk about on Thursday.
Readings
- Jean Vuillemin. A Data Structure for Manipulating Priority Queues
Links