数据结构实验二顺序队列

#include<iostream.h>
const int StackSize=100;
template<class DataType>
class SeqStack
{public:
SeqStack(){top=-1;}
~SeqStack(){}
void Push(DataType x){if((top+1)==100) cout<<"空间已满!";top++;data[top]=x;}
DataType Pop(){if(top==-1)cout<<"数据已空!";top--;for(int i=0;i<=100;i++)data[i-1]=data[i]; 
return data[0];}
void Show(){if(top==-1)cout<<"数据已空!";for(int i=0;i<=top;i++) cout<<data[i]<<"  ";cout<<endl;}
private:
DataType data[StackSize];
int top;
};
int main()
{SeqStack<int> S;int i;void caidan();
do
{
caidan();cout<<"Please enter your chioce:";cin>>i;
switch(i)
{case 1:cout<<"please eneter the number you want to push:";
int n;cin>>n;S.Push(n);break;
case 2:S.Pop();break;
case 3:S.Show();break;
case 4:break;
default:cout<<"enter error!"<<endl;}}while(i!=4);
return 0;}
void caidan()
{cout<<"1--入队;"<<endl;
 cout<<"2--出队;"<<endl;
 cout<<"3--显示."<<endl;
 cout<<"4--退出;"<<endl;
}