栈与队列习题课？？？.pptVIP

An Introduction to Database Systenm 队列的定义 循环队列-满与空的判定 2.少用一个元素空间： 队空：front = = rear 队满：(rear+1)%M = = front 解决方案： 1.另外设一个标志以区别队空、队满 0 1 2 3 4 5 rear front a1 a2 a3 a4 a5 0 1 2 3 4 5 rear front InitQueue Status InitQueue (SqQueue Q){ Q.base=(QELemType *)malloc(MAXQSIZE * sizeof(QELemType)); if (!Q.base) return (OVERFLOW); Q.front = Q.base=0;//物理位置 return(OK); } 0 1 2 3 4 5 rear front DestroyQueue Status DestroyQueue (SqQueue Q){ free(Q.base); return(OK); } QueueEmpty bool QueueEmpty (SqQueue Q){ if(Q.front = = Q.rear) return(TRUE); return(FALSE); } 0 1 2 3 4