数据结构-栈-顺序存储-基本运算

//栈//顺序存储//定义const int maxsize=6;typedef struct seqstack{DataType data[maxsize];int top;}SeqStk;//1.初始化int InitStack(SeqStk *stk){stk->top=0;return 1;}//2.判栈空int EmptyStack(SeqStk *stk){if (stk->top==0)return 1;else return 0;}//3.进栈int Push(SeqStk *stk,DataType x){if (stk->top==maxsize-1){error("stack full!");return 0;}else{stk->top++;stk->data[stk->top]=x;return 1;}}//4.出栈int Pop(SeqStk *stk){if (EmptyStack(stk)){error("underflow!");return 0;}else{stk->top--;return 1;}}//5.取栈顶元素DataType GetTop(SeqStk *stk){if (EmptyStack(stk))return NULLData;elsereturn stk->data[stk->top];}