数据结构课外辅导资料栈`队列抽象数据类型.pptVIP

栈 ( Stack )的概念;Abstract Data Types Abstract Stack --- Definition;栈的抽象数据类型 — 描述;栈的类表示（抽象数据类型）;顺序栈(c++) Contiguous Stack;链式栈 Linked Stack;template class Type class Stack { public: Stack ( int=10 ); //构造函数 void Push ( const Type item); //进栈 Type Pop ( ); //出栈 Type GetTop ( ); //取栈顶元素 void MakeEmpty ( ); //置空栈 int IsEmpty ( ) const; //判栈空否 int IsFull ( ) const; //判栈满否 };#include assert.h template class Type class Stack { public: Stack ( int=10 ); //构造函数 ~Stack ( ) { delete [ ] elements; }//析构函数 void Push ( const Type item ); //进栈 Type Pop ( ); //出栈 Type GetTop ( ); //取栈顶元素 void MakeEmpty ( ) { top=-1; } //置空栈 int IsEmpty ( ) const { return top == -1; } ; int IsFull ( ) const { return top == maxSize-1; } private: int top; //栈顶数组指针 Type *elements; //栈数组 int maxSize; //栈最大容量 } template class Type StackType:: Stack ( int s ) : top (-1), maxSize (s) { elements = new Type[maxSize]; assert ( elements != 0 ); //断言 };进栈示例;退栈示例;template class Type void StackType:: Push ( const Type item ) { assert ( !IsFull ( ) ); //先决条件断言 elements[++top] = item; //加入新元素 } template class Type Type StackType:: Pop ( ) { assert ( !IsEmpty ( ) ); //先决条件断言 return elements[top--]; //退出栈顶元素 };template class Type Type stackType:: GetTop ( ) { assert ( !IsEmpty ( ) ); //先决条件断言 return elements[top]; //取出栈顶元素 } 双栈共享一个栈空间 ;队列(Queue)的概念;Abstract Data Types Abstract Queue --- Definition;队列的抽象数据类型 — 描述;队列的类表示（抽象数据类型）;队列的顺序表示（类）Contiguous Queue;链式队列 Linked Queue;template class Type class Queue { public: Queue ( int=10 ); //构造函数 void EnQueue ( const Type item); //进队 Type DeQueue ( ); //出队列 Type GetFront ( ); //取队头元素值 void MakeEmpty ( ); //置空队列 int