栈栈的应用队列优先队列8.ppt

栈 栈的应用 队列 优先队列 栈 ( Stack ) 栈和队列 都是特殊的线性表 限定性的线性表 操作受限的线性表 一、栈 限定只在表的一端访问的线性表 元素只能从栈顶插入和删除 先进后出 后进先出 例 羊肉串 子弹夹 货 栈 顺序栈——栈类的顺序表示 #ifndef STACK_CLASS #define STACK_CLASS #include iostream.h #include stdlib.h const int MaxStackSize = 50; templateclass T class Stack { T stacklist[MaxStackSize]; int top; public: Stack (void); void Push (const T item); T Pop (void); void ClearStack(void); T Peek (void) const; //gettop int StackEmpty(void) const; int StackFull(void) const; }; // initialize stack top. templateclass T StackT::Stack (void) : top(-1) { } // push item on the the stack templateclass T void StackT::Push (const T item) { // if stacklist is full, terminate the program if (top == MaxStackSize-1) { cerr Stack overflow! endl; exit(1); } // increment top and copy item to stacklist top++; stacklist[top] = item; } // pop the stack and return the top element templateclass T T StackT::Pop (void) { T temp; // if stack is empty, terminate the program if (top == -1) {cerr Attempt to pop an empty stack! endl; exit(1); } temp = stacklist[top]; // record the top element top--; return temp; } // return the value at the top of the stack templateclass T T StackT::Peek (void) const { // if the stack is empty, terminate the program if (top == -1) {cerr Attempt to peek at an empty stack! endl; exit(1); } return stacklist[top]; } // test for an empty stack templateclassT int StackT::StackEmpty(void) const { // return the logical value top == - 1 return top == -1; } // test for a full stack templateclass T int StackT::StackFull(void) const { // test the position of top return top == MaxStackSize-1; } // clear all items from the stack templateclass T void StackT::ClearStack(void) { top = -1; } #endif // ST