程序第03章栈和队列.docVIP

第3章 堆栈和队列 程序3.1 堆栈类 #include iostream.h template class T class Stack { //栈类Stack是一个模板抽象类，其成员函数为纯虚函数，未定义数据成员 public: virtual bool Push(T x)=0; virtual bool Pop()=0; virtual bool Top(T x) const=0; …… }; 程序3.2 顺序栈类 #include stack.h template class T class SeqStack:public StackT { public: SeqStack(int mSize); ~SeqStack() { delete [ ]s; } bool IsEmpty() const { return top==-1; } bool IsFull() const { return top==maxTop; } bool Top(T x) const; bool Push(T x); bool Pop(); void Clear() { top=-1; } private: int top; //栈顶指针 int maxTop; //最大栈顶指针T *s; }; template class T SeqStackT::SeqStack(int mSize) { maxTop=mSize-1; s=new T[mSize]; top=-1; } template class T bool SeqStackT::Top(T x) const { if(IsEmpty()) { coutEmptyendl; return false; } x=s[top];return true; } template class T bool SeqStackT::Push(T x) { if(IsFull()){ //溢出处理 coutOverflowendl; return false; } s[++top]=x; return true; } template class T bool SeqStackT::Pop() { if(IsEmpty()) { //空栈处理 coutUnderflowendl; return false; } top--; return true; } 程序3.3 队列类 #include iostream.h template class T class Queue { public: virtual bool IsEmpty() const=0; virtual bool IsFull() const=0; virtual bool Front(T x) const=0; virtual bool EnQueue(T x)=0; virtual bool DeQueue()=0; }; 程序3.4 循环队列类 #include queue.h template class T class SeqQueue:public QueueT { public: SeqQueue(int mSize); ~SeqQueue(){ delete [] q; }; bool IsEmpty() const {return front==rear;} bool IsFull() const {return (rear+1) % maxSize==front;} bool Front(T x) const; bool EnQueue(T x); bool DeQueue(); private: int front,rear; int maxSize; T *q; }; template class T SeqQueueT::SeqQueue(int mSize) { maxSize=mSize; q=new T[maxSize]; front=rear=0; } template class T bool SeqQueueT::Front(T x) cons