栈的基本运算

#include<iostream.h>
typedef char ElemType;
#define maxsize 50
typedef struct
{
ElemType data[maxsize]; //存放栈中的数据元素
int top; //栈顶指针，即存放栈顶元素在data数组中的下标
}sqstack;
//1.初始化栈
void chushi(sqstack *&s)
{
s=new sqstack;
s->top=-1; //栈顶指针置为-1
}
//2.判断栈是否为空
bool jianyan(sqstack *s)
{
return (s->top==-1);
}
//3.元素进栈
bool push(sqstack *&s,ElemType e)
{
if(s->topmaxsize-1) //栈满的情况，即栈上溢出
return false;
s->top++; //每输入一个元素，栈顶加1
s->data[s->top]=e; //元素e放在栈顶指针处
return true;
}
//4.元素出栈
bool pop(sqstack *&s,ElemType &e)
{
if(s->top-1) //栈为空的情况，即栈下溢出
return false;
e=s->data[s->top];//取栈顶元素
s->top–; //栈顶指针减1
return true;
}
//5.取栈顶元素
bool GetTop(sqstack *s,ElemType &e)
{
if(s->top==-1)
return false;
e=s->data[s->top];
return true;
}
//6.销毁栈
void xiaohui(sqstack *s)
{
delete(s);
}
void main()
{
ElemType e,q,W;
int c;
sqstack *s1;
chushi(s1);
cout<<“请输入你要输入元素的个数：”;
cin>>c;cout<<endl;
for(int i=0;i<c;i++)
{
cout<<“请输入你要输入的”<<i+1<<“个元素：”;
cin>>e;
if(push(s1,e))
cout<<“第”<<i+1<<“个元素进栈成功”<<endl;
else
cout<<“第”<<i+1<<“个元素进栈不成功,已栈满”<<endl;
}
jianyan(s1);
if(jianyan(s1))
cout<<“该栈为空”<<endl;
else
cout<<“该栈不为空”<<endl;
if(GetTop(s1,W))
{
cout<<“栈顶元素出栈成功”<<endl;
cout<<“该栈的栈顶元素为：”;
cout<<W<<endl;
}
else
cout<<“栈顶元素出栈不成功”<<endl;

for(i=c;i>0;i--)
{   
	if(pop(s1,q))
	{
		cout<<"第"<<i<<"个元素出栈成功"<<endl;
	    cout<<"该栈的存放的第"<<i<<"个元素为：";
	    cout<<q<<endl;
	}
	else
		cout<<"该元素出栈不成功"<<endl;
}
   xiaohui(s1);

}