出链队列的完整算法如下: int Queue Delete(LQueue *Q, Data Type*d) LQNode *p: if(Q->front = NULL) { printf("队列已空无数据元素出队列!n"; return o;} else *d=Q->front->data; p=Q->front; Q->front =Q->front->next if(Q->front = NULL)Q->rear NULL; free(p); return 1; J6 出链队列的完整算法如下： int QueueDelete(LQueue *Q, DataType *d) { LQNode *p; if(Q->front == NULL) { printf("队列已空无数据元素出队列! \n");return 0;} else { *d = Q->front->data; p = Q->front; Q->front = Q->front->next; if(Q->front == NULL) Q->rear = NULL; free(p); return 1; } }