Data Structures and Algorithms
with Object-Oriented Design Patterns in C++ 
A binomial queue is a mergeable priority queue implemented as a forest of binomial trees. In this section we present a pointer-based implementation of the forest. I.e., the forest is represented using a linked list of pointers to binomial trees.
Program 
defines the BinomialQueue class.
The BinomialQueue is derived from
the MergeablePriorityQueue abstract base class.
Program: BinomialQueue Class Definition
Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.