中山大学数据结构课件Chapter6 Queues.pdfVIP

Chapter 6 Queues 信息科学与技术学院 黄方军 huangfj@mail.sysu.edu.cn 东校区实验中心B501 1 数据结构算法与应用 Bird’s-Eye View  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. 2 数据结构算法与应用 Bus Stop Queue Bus Stop front rear rear rear rear rear 3 Bus Stop Queue Bus Stop front rear rear rear 4 Bus Stop Queue Bus Stop front rear rear 5 Bus Stop Queue Bus Stop front rear rear 6 6.1 The Abstract Data Type 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 top element from queue and put it in x ; } 7 数据结构算法与应用 6.2 Formula-Based Representation front rear