void EnQueue(struct DynArrayQueue *Q, struct BinaryTreeNode *data){ if(IsFullQueue(Q)) ResizeQueue(Q); Q->rear = (Q->rear + 1) % Q->capacity; Q->array[Q->rear] = data; if(Q->front == -1) Q->front = Q->rear; }
void EnQueue(QNode* queue,struct TNode* node){ if((queue->rear+1)%queue->capacity==queue->front){ ResizeQueue(queue); } queue->rear=(queue->rear+1)%queue->capacity; queue->Array[queue->rear]=node; if(queue->front==-1){ queue->front=0; } }
void EnQueue(QNode* queue,int data){ if(IsFullQueue(queue)){ ResizeQueue(queue); }else{ queue->rear=(queue->rear+1)%queue->capacity; queue->Array[queue->rear]=data; if(queue->front==-1){ queue->front=queue->rear; } } }