|
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 linked-list implementation of the forest. That is, the forest is represented using a linked list of binomial trees.
Program 
introduces the BinomialQueue class.
The BinomialQueue class extends the AbstractContainer class
introduced in Program
and it implements the MergeablePriorityQueue interface
defined in Program .
Program: BinomialQueue fields.
Copyright © 2001 by Bruno R. Preiss, P.Eng. All rights reserved.