c语言课件：栈及队列.pptVIP

栈和队列;;;栈与子程序调用;;;;; ;顺序栈的几种基本运算;void Push(Stack S,Element e) /*将元素e插入栈S顶部*/ { if(S.top==maxsize-1) Serr = StackOverflow; else {S.top++; S.data[S.top]=e;} } /* Push */;/*若栈S非空，取出栈顶元素删除*/ void Pop(Element e,Stack S) /* Pop */ { if (Empty(S)) Serr=StackUnderflow; else {e=S.data[S.top]; S.top--;} };/*取顺序栈S的栈顶*/ Element Top(Stack S) /* Top */ { if (Empty(S)) {输出“栈空”; return NULL;} else {return(S.data[S.top]);} } ;链栈;;void Push(Element e,Stack S) { Position p; p=new(Cell); p-e1=e; p-next=S.top; S.top=p; };链栈退栈运算;栈小结;栈的应用举例一数制转换; 例 把十进制数159转换成八进制数。;void conversion( ) //conversion { Initstack(S); scanf(“%d”,N); while(N) {Push(S,N % 8) ; N=N/8 ; } while (! Stackempty(s)) { Pop(S,e); Printf(“%d”,e); } };栈的应用举例一算术表达式;例 计算 2+4-3*6;队列;队列的基本概念;队列的基本运算;顺序队列;;;;;Setnull(queue *sq) { sq-head＝0; sq-tail＝0; } ;Bool Empty(queue *sq) { if (sq-tail == sq-head) return (True); else return (False); } ;datatype Front(queue *sq) { datatype temp; if (Empty(sq)) { printf(“queue is empty\n”); return NULL;} else { temp= sq-data [sq-head]; return temp ; } };Bool Enqueue(queue *sq, datatype x) { if (sq-head= =(sq-tail+1)%m) {printf(“queue is full\n”; return NULL);} else { sq-tail＝(sq-tail+1); sq-data[sq-tail]＝x; return(True); } };datetype Dequeue(queue *sq) { if (Empty(sq)) {printf(“queue is empty\n”);return NULL;} else { sq-head＝(sq-head+1); return(sq-data[sq-head]); } };循环队列 (Circular Queue);;循环队列 (Circular Queue);;;;typedef struct { linklist *head,*tail; } linkqueue; ;Setnull (linkqueue *q) { q-head＝malloc(sizeof(linklist)); q-head-next＝NULL; q-tail＝q-head; } ;int Empty(linkqueue *q) { if ( q-head == q-tail ) return(True); else return(False); } ;datatype Front(linkqueue *q) { if (Empty(q)) {printf(“queue is empty\n”); return NULL;} else return(q-head-next-data); } ;Enqueue(linkqueue *q, datatype x) {