void EnQueue_L (LinkQueue &Q, QElemType e) 
{
   // 插入元素e為鏈隊(duì)列Q中新的隊(duì)尾元素
   p = new LNode;
   p->data = e;
   p->next = NULL;
   Q.rear->next = p;
   Q.rear = p;
}//EnQueue_L

bool DeQueue_L (LinkQueue &Q, QElemType &e) 
{
   // 若隊(duì)列不空，則刪除Q的隊(duì)頭元素，用e返回其值，并返回TRUE；
   // 否則返回FALSE
   if (Q.front == Q.rear)
     return FALSE;
   p = Q.front->next;
   e = p->data;
   Q.front->next = p->next;
   if (Q.rear == p)
     Q.rear = Q.front;
   delete p;
   return TRUE;
}//DeQueue_L