栈的相关操作.doc

/*栈的相关操作*/#include#define maxsize 64#define n 10typedef int datatype;typedef struct datatype datamaxsize; int top;seqstack;seqstack *s;/*置空栈*/SETNULL(seqstack *s) s-top=-1; printf(Setnull over!);/*判栈空*/int EMPTY(s)seqstack *s; if(s-top=-1) return 1; else return 0; /*进栈*/seqstack *PUSH(s,x)seqstack *s;datatype x; int an; int i; for(i=0;itop=maxsize-1) printf(overflow); return NULL; else s-top+; s-datas-top=x; printf(%d ,s-datas-top); return s;/*退栈*/datatype POP(s)seqstack *s; if(EMPTY(s) printf(underflow); else s-top-; printf(%d,s-datas-top+1); /*取栈顶*/datatype TOP(s)seqstack *s; if(EMPTY(s) printf(stack is empty); return NULL; else printf(%d,s-datas-top);/*主函数*/void main() int c; do printf(n*); printf(ttttZhan xiang guan cao zuon); printf(-n); printf(tt1 t2 t3 t4 t5 t6n); printf(-n); printf(ttSetnull Empty tPush tPop tTop tExit); printf(n*); printf(nPlease enter your choice:); scanf(%d,&c); switch(c) case 1: SETNULL(s); printf(nContinuen); break; case 2: EMPTY(s); if( EMPTY(s) printf(The stack is empty!); else printf(The stack is not empty!); printf(nContinuen); break; case 3: datatype x; printf(Please input your datas:n); PUSH(s,x); printf(nContinuen); break; case 4: POP(s); printf(nContinuen); break; case 5: TOP(s); printf(nContinuen); break; c