基于C++的队列结构应用.pdfVIP

Chapter 6 Queues 1 Outline • Concept • Representation • Applications 2 Concept • Linear list. • One end is called front. • Other end is called rear. • Additions are done at the rear only. • Removals are made from the front only. 3 Bus Stop Queue Bus Stop front rear rear rear rear rear 4 Bus Stop Queue Bus Stop front rear rear rear 5 Bus Stop Queue Bus Stop front rear rear 6 Bus Stop Queue Bus Stop front rear 7 The Abstract Data Type Queue AbstractDataType Queue { instances ordered list of elements; one end is called thefront ; the other is the rear; operations Create(): create an empty queue; IsEmpty() : return true if queue is empty, return false otherwise; IsFull() : return true if queue is full, return false otherwise; First() : return first element of queue; Last() : return last element of queue; Add(x): add element x to the queue; Delete(x) : delete first element from queue and put it in x ; } 8 Outline •