Queue Implementation

Choose an appropriate List class as a base class.
- Good choices
  - CircArrayList
  - LinkedListwTail
  - DoublyLinkedList
  - CircLinkedList
- Bad choices
  - ArrayList
  - LinkedList
Use private inheritance to enforce the Queue structure on the List.
Implementation of Queue member functions
- Queue() {}
- Queue(const Queue& q) : List(q) {}
- T Head() const {GetElement(1);}
- int Size() const {return List::Size();}
- bool Empty() const {return List::Empty();}
- void Enqueue(const T& value) {PushBack(value);}
- T Dequeue() {return PopFront();}
- void MakeEmpty() {List::MakeEmpty();}
- void Input(istream& in) {List::Input(in);}
- void Output(ostream& out) const {List::Output(out)}
- void Validate() const {List::Validate();}

Return to Lectures page

This page was last modified on Mar 28, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/Queues.html