1///链队列2structLQueue3{4intdata;5LQueue *next;67};89structQueue10{11LQueue *front,*rear;///队头队尾不存元素12};13intEnQueue(Queue *qu,intx)14{15LQueue *p;16p = (LQueue *)malloc(sizeof(LQueue));17if(!p)returnERROR;18else19{20p->data=x;21qu->rear->next =p;22qu->rear...