数据结构实验三之顺序栈.pdf

#includestdio.h #includemalloc.h #define MAXSIZE 100 typedef int DataType; typedef struct stack { DataType data[MAXSIZE]; int top; }sqstack; sqstack *InitStack(sqstack *S)//顺序栈的初始化 { S-top=-1; return S; } void push(sqstack *S,DataType x)//顺序栈的元素入栈 { if(S-topMAXSIZE-1) printf(error!); else S-top++; S-data[S-top]=x; } DataType pop(sqstack *S)//顺序栈的元素出栈 { int x; if(S-top==-1) printf(Underflow!); else { x=S-data[S-t