【数据结构之顺序栈的基本运算】

//顺序栈public class OrderStack {//(1)置空栈void InitStack(SeqStack *S){S->top = -1;}//(2)判断栈空int StackEmpty(SeqStack *S){return S->top == -1;}//(3)判断栈满int StackFull(SeqStack *S){return S->top == StackSize-1;}//(4)进栈void push(S,x){if(StackFull(S)){Erro("Stack overflow");//上溢,退出运行}S->data[++S->top]=x;//栈顶}//(5)退栈DataType Pop(S){if(StackEmpty(S)){Error("Stack underflow");//下溢,退出运行}return S->data[S->top--];//栈顶元素出栈后,将栈顶指针下移一位}//(6)取栈顶元素DataType StackTop(S){if(StackEmpty(S)){Error("Stack underflow");//下溢,退出运行}return S->data[S->top];//}}