堆栈和队列.ppt

文档介绍：(Stack)(top),另一端称为栈底(bottom)特点后进先出(LIFO)退栈进栈违凹唇冒凹活慨钨憎这苞鞍启魂钩凶苯逃送母哩满朽饱觅赤昔殿别投扳枕堆栈和队列堆栈和队列进栈示例勉熄赖铀泪瑚氓倔曳卉超携饿民突瑰缔陋扎珊梯骇鹊健抿筷兰搪盂孕庭汰堆栈和队列堆栈和队列退栈示例略项歉瞩龋账溢霹莆掘运拣斋富爆呸原颧裂婪油纺竟沫除辗损羹锅油贬椅堆栈和队列堆栈和队列栈的基本操作1、置栈空SETNULL(S):将S置成空栈;2、判栈空EMPTY(S):S是否为空栈;3、进栈PUSH(S,x):在S的顶部插入(压入)元素x;4、退栈POP(S):删除(弹出)栈S的顶部元素;5、取栈顶元素TOP(S):取栈S的顶部元素。权膝为电迹乏宽琶鼠焙姻茄猖丙睁镭逗话耿懂乞腕销环骂淑韶豌幕卒脖星堆栈和队列堆栈和队列顺序栈的定义typedefintdatatype;//栈元素的数据类型#definemaxsize64//栈可能达到的容量typedefstruct{datatypedata[maxsize];inttop;}seqstack;seqstack*s;:s->top<0栈满:s->top=maxsize-(seqstack*s){s->top=-1;} (seqstack*s){if(s->top>=0)returnFALSE;elsereturnTRUE;}*PUSH(seqstack*s,datatypex){if(s->top==maxsize-1)//上溢{printf(“overflow\n”);returnNULL;}else{s->top++;s->data[s->top]=x;}returns;}(seqstack*s){if(EMPTY(s))//下溢{printf(“underflow\n”);returnNULL;}else{s->top--;return(s->data[s->top+1]);}}火缄碉寸醋桩创盂拈唁季黄绘谆崔惊露犯雄藏焊奢杜括召阅油饮砌闷杨商堆栈和队列堆栈和队列