顺序栈的操作实现(Push) 插入元素e为新的栈顶元素。 Status Push(Sqstack *s, SElem Type e) I if (s->top -s-base >=s->stacksize /*栈满,追加存储空间米 I I temp=(SElemType*realloc (s->base, (s->stacksize+STACKINCREMENT 米 sizeof( SElemType) if (1 temp) return (OVERFLOW) s>base=I temp s-top >base s>stacksize sstacksize += STACKIncrement 冰(s->top e: return OK. 1/*Push顺序栈的操作实现 （Push） 插入元素e为新的栈顶元素。 Status Push(SqStack *s, SElemType e) { if (s->top – s->base >= s->stacksize) /* 栈满，追加存储空间 */ { l_temp=(SElemType*)realloc (s->base,(s->stacksize+STACKINCREMENT) *sizeof(SElemType)); if (!l_temp) return(OVERFLOW); s->base = l_temp; s->top = s->base + s->stacksize; s->stacksize += STACKINCREMENT; } *(s->top++) = e; return OK; } /* Push */