ADT Queue

Tom Kelliher, CS23

Mar. 22, 1996

This discussion of the ADT will be brief. I bet most, if not all, of you know what a queue is, so there's little point in me explicitly covering it. I'll just define the ADT and mention a few implementations. There's a good chance I won't even discuss this material in class; so you're responsible for it and I'll leave it to you to clear up any points of confusion by asking questions.

What we'll really do is either:

ADT Queue

Queue is FIFO; stack is FILO.


Array-Based Implementation

Dynamic, Pointer-Based Implementation

A Derived Class Implementation

Thomas P. Kelliher
Thu Mar 21 10:44:33 EST 1996
Tom Kelliher