第八周数据库结构

void enQueue(LinkQueue &Q,QElemType e){
Q.rear->next=(QNode *)malloc(sizeof(QNode));
Q.rear->next->data=e;
Q.rear->next->next=NULL;
Q.rear=Q.rear->next;
}
void deQueue(LinkQueue &Q,QElemType &e){
if(Q.front==Q.rear){
printf("队列为空，出队失败");
exit(0);

}
else{
QueuePtr p=Q.front->next;
e=p->data;
Q.front->next=p->next;
if(Q.front->next==NULL)
{
Q.rear=Q.front;
}
free(p);
}
}