实验2：栈和队列的基本操作实现及其应用

顺序栈

#include<iostream.h>

const int StackSize=10;

template<class DataType>

class SeqStack

{

       public:

              SeqStack();

              ~SeqStack(){}

              voidPush(DataType x);

              DataTypePop();

              DataTypeGetTop();

              intEmpty();

       private:

              DataTypedata[StackSize];

              inttop;

};

 

template<class DataType>

SeqStack<DataType>::SeqStack()

{

       top=-1;

}

 

template<class DataType>

voidSeqStack<DataType>::Push(DataType x)

{

       if(top==StackSize-1)throw"上溢";

       top++;

       data[top]=x;

}

 

template<class DataType>

DataType SeqStack<DataType>::Pop()

{

       DataTypex;

       if(top==-1)throw"下溢";

       x=data[top--];

       returnx;

}

 

template<class DataType>

DataType SeqStack<DataType>::GetTop()

{

       if(top!=-1)

       returndata[top];

}

 

template<class DataType>

int SeqStack<DataType>::Empty()

{

       if(top==-1)return 1;

       elsereturn 0;

}

 

void main()

{

       SeqStack<int>S;

       if(S.Empty())

              cout<<"栈为空"<<endl;

       else

              cout<<"栈非空"<<endl;

              cout<<"对15和10执行入栈操作"<<endl;

              S.Push(15);

              S.Push(10);

              cout<<"栈顶元素为:"<<endl;

              cout<<S.GetTop()<<endl;

              cout<<"执行一次出栈操作"<<endl;

              S.Pop();

              cout<<"栈顶元素为："<<endl;

              cout<<S.GetTop()<<endl;

}

 

 

链栈

#include<iostream.h>

class Node{ 

   friend class LinkStack; 

private: 

int data;                  

Node *next;           

}; 

class LinkStack

{

Node *top;    

public:

LinkStack();      

~LinkStack(){};        

void Push(int x);         

int Pop();             

int GetTop();      

int Empty();            

};

LinkStack::LinkStack()

{

top=NULL;

}

void LinkStack::Push(int x)

{

Node *s;            

s=new Node;

s->data=x;

s->next=top;

top=s;

}

int LinkStack::Pop()

{ Node *p;

if(top==NULL)throw"下溢!";   

int x=top->data;

p=top;

top=top->next;

delete p;

return x;

}

int LinkStack::GetTop()

{   

if(top!=NULL)

return top->data;

}

int LinkStack::Empty()         

{

if(top==NULL) return 1;    

       else return 0;

}

void main()

{

LinkStack S;        

cout<<"为";

if(S.Empty())

cout<<"栈为空!"<<endl;

else cout<<"栈非空!"<<endl;

cout<<"对5,8和15执行入栈操作!"<<endl; 

S.Push(5);

S.Push(8);

S.Push(15);

cout<<"栈顶元素为:"<<endl;

cout<<S.GetTop()<<endl;    

cout<<"执行一次出栈操作!"<<endl;

S.Pop();                          

cout<<"栈顶元素为:"<<endl;

cout<<S.GetTop()<<endl;

}

 

链队列

#include<iostream.h>

template<class DataType>

struct Node

{

       DataTypedata;

       Node<DataType>*next;

};

 

template<class DataType>

class LinkQueue

{

       public:

              LinkQueue();

              ~LinkQueue();

              voidEnQueue(DataType x);

              DataTypeDeQueue();

              DataTypeGetQueue();

              intEmpty();

       private:

              Node<DataType>*front, *rear;

};

 

 

template<class DataType>

LinkQueue<DataType>::LinkQueue()

{

       Node<DataType>*s=NULL;

       s=newNode<DataType>;

       s->next=NULL;

       front=rear=s;

}

 

template<class DataType>

LinkQueue<DataType>::~LinkQueue()

{

       Node<DataType>*p=NULL;

       while(front!=NULL)

       {

              p=front->next;

              deletefront;

              front=p;

       }

}

 

template<class DataType>

voidLinkQueue<DataType>::EnQueue(DataType x)

{

       Node<DataType>*s=NULL;

       s=newNode<DataType>;

       s->data=x;

       s->next=NULL;

       rear->next=s;rear=s;

}

 

template<class DataType>

DataTypeLinkQueue<DataType>::DeQueue()

{

       Node<DataType>*p=NULL;

       intx;

       if(rear==front)throw"下溢";

       p=front->next;

       x=p->data;

       front->next=p->next;

       if(p->next==NULL)rear=front;

       deletep;

       returnx;

}

 

template<class DataType>

DataTypeLinkQueue<DataType>::GetQueue()

{

       if(front!=rear)

   return front->next->data;

}

 

template<class DataType>

int LinkQueue<DataType>::Empty()

{

       if(front==rear)

              return1;

       else

              return0;

}

 

void main()

{

       LinkQueue<int>Q;

       if(Q.Empty())

              cout<<"队列为空"<<endl;

       else

              cout<<"队列非空"<<endl;

       cout<<"元素10和15执行入队操作："<<endl;

       try

       {

              Q.EnQueue(10);

              Q.EnQueue(15);

       }

      

       catch(char*wrong)

       {

              cout<<wrong<<endl;

       }

       cout<<"查看队头元素："<<endl;

       cout<<Q.GetQueue()<<endl;

       cout<<"执行出队操作"<<endl;

       try

       {

              Q.DeQueue();

       }

       catch(char*wrong)

       {

              cout<<wrong<<endl;

       }

       cout<<"查看队头元素："<<endl;

       cout<<Q.GetQueue()<<endl;

}