Status QueueTraverse(SqQueue Q)
{
// 若队列不空,则从队头到队尾依次输出各个队列元素,并返回OK;否则返回ERROR.
int i;
i=Q.front;
if(Q.front==Q.rear)printf("The Queue is Empty!"); //请填空
else{
printf("The Queue is: ");
while(i != Q.rear) //请填空
{
printf("%d ",Q.base[i] ); //请填空
i = (i+1)%MAXQSIZE; //请填空
}
}
printf("\n");
return OK;
}