6-4 带头结点的链队列的基本操作 (10 分)-数据结构第3章

Status QueueInsert(LinkQueue *Q,ElemType e)
{
	LinkList p =(LNode*)malloc(sizeof(LNode));
	p->data = e;
	p->next = NULL;
	Q->rear->next = p;
	Q->rear = p;
	return OK;
}

Status QueueDelete(LinkQueue *Q,ElemType *e)
{
	*e = Q->front->next->data;
	Q->front->next=Q->front->next->next;
	return OK;
}