数据结构课程讲义(C++)Chapter06_.pdfVIP

Chapter 6 Queues • 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. 1 Bus Stop Queue Bus Stop front rear rear rear rear rear 2 Bus Stop Queue Bus Stop front rear rear rear 3 Bus Stop Queue Bus Stop front rear rear 4 Bus Stop Queue Bus Stop front rear rear 5 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 iff the queue is empty, false otherwise; IsFull() : return true iff the queue is full, 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 ; } 6 Data Representation • Formula-Based • Base class • Linked Representation • Derived class