void insertQ( StrQueue* queue, char* str ) { if( isFullQ(queue) == 0 ){ queue->rear = (queue->rear + 1) % Q_ARR_MAX; queue->queue[ queue->rear ] = str; }else{ printf("queue is full"); } }
int enque(QUEUE *Q,int data) { if(isFullQ(*Q)) return 0; else { ++(Q->rear); Q->q[Q->rear]=data; if(Q->front==-1) ++(Q->front); return 1; } }