数据实验二

数据结构实验二

1.顺序栈

const int StackSize=10;

template<class DataType>

class SeqStack

{

public:

SeqStack();

~SeqStack(){}

void Push(DataType x);

DataType Pop();

int Empty();

private:

DataType data[StackSize];

int top;

};

template<class DataType>

SeqStack<DataType>::SeqStack()

{

top=-1;

}

template<class DataType>

void SeqStack<DataType>::Push(DataType x)

{

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

top++;

data[top]=x;

}

template<class DataType>

DataType SeqStack<DataType>::Pop()

{

DataType x;

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

x=data[top--];

return x;

}

template<class DataType>

int SeqStack<DataType>::Empty()

{

if(top==-1)return 1;

else return 0;

}

#include<iostream>

using namespace std;

void main()

{

SeqStack<int>S;

if(S.Empty())

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

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

cout<<"对100和99实行入栈操作"<<endl;

S.Push(100);

S.Push(99);

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

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

cout<<"执行第二次出栈操作"<<endl<<S.Pop()<<endl;

cout<<"此时栈的状态为：";

if(S.Empty())

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

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

 

}

 

02.链栈

#include<iostream>

using namespace std;

template<class DataType>

struct Node

{

DataType data;

Node<DataType> *next;

};

template<class DataType>

class LinkStack

{

public:

LinkStack(){top=NULL;}

~LinkStack()

{

while(top!=NULL)

{

Node<DataType> *p;

p=new Node<DataType>;

p=top->next;

delete top;

top=p;

}

}

void Push(DataType x);

DataType Pop();

int Empty();

private:

Node<DataType> *top;

};

template<class DataType>

void LinkStack<DataType>::Push(DataType x)

{

Node<DataType> *s;

s=new Node<DataType>;

s->data=x;

s->next=top;

top=s;

}

template<class DataType>

DataType LinkStack<DataType>::Pop()

{

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

DataType x;

x=top->data;

Node<DataType> *p;

p=new Node<DataType>;

p=top;

top=top->next;

delete p;

return x;

}

template<class DataType>

int LinkStack<DataType>::Empty()

{

if(top==NULL)return 1;

else return 0;

}

 

void main()

{

LinkStack<int>S;

if(S.Empty())

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

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

cout<<"对100和99实行入栈操作"<<endl;

S.Push(100);

S.Push(99);

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

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

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

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

cout<<"此时栈的状态为：";

if(S.Empty())

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

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

}

 

03．链队列 

#include<iostream>

using namespace std;

template<class DataType>

struct Node

{

DataType data;

Node<DataType> *next;

};

template<class DataType>

class LinkQueue

{

public:

LinkQueue();

~LinkQueue();

void EnQueue(DataType x);

DataType DeQueue();

DataType GetQueue();

int Empty();

private:

Node<DataType> *front,*rear;

};

template<class DataType>

LinkQueue<DataType>::LinkQueue()

{

Node<DataType>*s=NULL;

s=new Node<DataType>;

s->next=NULL;

front=rear=s;

}

template< class DataType>

LinkQueue<DataType>::~LinkQueue()

{

Node<DataType>*p=NULL;

while(front!=NULL)

{

p=front->next;

delete front;

front=p;

}

}

template< class DataType>

void LinkQueue<DataType>::EnQueue(DataType x)

{

Node<DataType>*s=NULL;

s=new Node<DataType>;

s->data=x;

s->next=NULL;

rear->next=s;

rear=s;

}

template<class DataType>

DataType LinkQueue<DataType>::DeQueue()

{

Node<DataType> *p=NULL;

DataType x;

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

p=front->next;

x=p->data;

front->next=p->next;

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

delete p;

return x;

}

template<class DataType>

DataType LinkQueue<DataType>::GetQueue()

{

if(front!=rear)

return front->next->data;

}

template<class DataType>

int LinkQueue<DataType>::Empty()

{

if(front==rear)

return 1;

else return 0;

}

 

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;

}