This preview shows page 1. Sign up to view the full content.
Unformatted text preview: // Post: newItem is at rear of queue. void Enqueue( int item ) // Dequeue: Removes element from from front of queue // and returns it in item. // Pre: Queue has been initialized. // Queue is not empty. // Post: Front element has been removed from queue. // item is a copy of removed element. void Dequeue( int& item ) // MakeEmpty: // Post: Queue is empty all elements deallocated. void MakeEmpty( ) // print: Print all queue elements void print() private: NodeType* qFront // Pointer to front of queue NodeType* qRear // Pointer to raar of queue } #endif...
View Full Document
This note was uploaded on 10/13/2008 for the course CS 215 taught by Professor Piwowarski during the Spring '06 term at Kentucky.
- Spring '06