Class Summary |
AbstractPriorityQueue |
Abstract class for the priority queue data structure. |
AbstractQueue |
Abstract class for the queue data structure. |
AbstractStack |
Abstract class for the stack data structure. |
BalkingQueue |
This class implements a balking queue, which is an extension
of an AbstractQueue that implements all the remove methods of
the Collection interface. |
PrioritizedItem |
The PrioritizedItem class contains objects which consist of
a comparable object which represents the explicit priority, and
a general object which is the prioritized datum. |
PriorityQueueAL |
This class implements a Queue using a dynamic array |
QueueAL |
This class implements a Queue using a dynamic array |
QueueCL |
This class implements a Queue using a circular list
embedded in a dynamic array |
QueueLL |
This class implements a Queue using a simple Linked List. |
StackAL |
This class implements a Stack using a dynamic array |
StackLL |
This class implements a Stack using a simple Linked List. |