/*
*顺序栈的创建
*出栈
*入栈
*取栈顶元素
*判断栈空
*/
#include<stdio.h>
#define MAXSIZE 1024
typedef int element;
typedef struct sequstack
{
element data[MAXSIZE];
int top;
}Sequ_Stack;
Sequ_Stack*creat_stack();//顺序栈的创建
int full_stack(Sequ_Stack*s);
int empty_stack(Sequ_Stack*s);
int length_stack(Sequ_Stack*s);
int push_stack(Sequ_Stack*s,element x);//入栈
int pop_stack(Sequ_Stack*s,element*x);//出栈
int get_data(Sequ_Stack*s,element *x);
void main()
{
Sequ_Stack*s;
element x;
element y;
element z;
s=creat_stack();
if(s->top==-1)
printf("顺序栈创建失败:\n");
else
printf("顺序栈创建成功:\n");
if(full_stack(s)==1)
printf("顺序栈已经满:\n");
else
printf("顺序栈没有满:\n");
if(empty_stack(s))
printf("栈为空;\n");
else
pr