中山大学数据结构课件Chapter5 Stacks.pdfVIP

Chapter 5 Stacks 信息科学与技术学院 黄方军 huangfj@mail.sysu.edu.cn 东校区实验中心B501 1 数据结构算法与应用 Bird’s-Eye View  Linear list.  One end is called top.  Other end is called bottom.  Additions to and removals from the top end only. 2 数据结构算法与应用 5.1 The Abstract Data Type top F top E E D D C C B B bottom A bottom A A stack is a LIFO list. 3 数据结构算法与应用 5.1 The Abstract Data Type AbstractDataType Stack {instances linear list of elements; one end is called the bottom; the other is the top; operations Create(): create an empty stack; isEmpty(): return true iff the stack is empty, false otherwise; isFull(): return true iff the stack is full, false otherwise; Top(): return top element of stack; Add(x): add element x to the stack; Delete(x) : delete top element from stack and put it in x ; } 4 数据结构算法与应用 5.2 Derived classes and inheritance Base class Derived class class B : public A; class B : public A, private C;