(3)出队 void DeQueue(QUEUE*Q, QueueEntry *item) f( QueueEmpty(Q) exit(“ Queue is empt!.”); else Q->front=(Q->front+1)%MAX QUEUE *itemQ->item( Q->front]; 请单赤鼠标左键换页!（3）出队 void DeQueue(QUEUE*Q,QueueEntry *item) { if (QueueEmpty(*Q)) exit(“Queue is empty.”); else { Q->front=(Q->front+1)%MAX_QUEUE; *item=Q->item[Q->front]; } }