队列的链式存储结构及实现

//队列的链式存储结构及实现
typedef int QElemType;

//链队列的结构
typedef struct QNode
{
	QElemType data;
	struct QNode * next;
}QNode,* QueuePtr;

typedef struct
{
	QueuePtr front,rear	//队头，队尾指针
}LinkQueue;

//入队操作，在链表尾部插入结点e
status EnQueue(LinkQueue * Q,QElemType e)
{
	QueuePtr a = (QueuePtr) malloc (sizeof(QNode));
	if(!s)	//存储空间分配失败
		exit(OVERFLOW);
	s->data = e;
	s->next = NULL;
	Q->rear->next = s;	//把拥有元素的e新结点s赋值给原队列结点的后继
						//把当前的s设置为队列结点，rear指向s
	Q->rear = s;
	return OK;
}
//出队操作，删除Q队头元素，用e返回其值
Status DeQueue(LinkQueue * Q,QElemType * e)
{
	QueuePtr p;
	if(Q->front == Q->rear)
		return ERROR;
	p = Q->front->next;	//将与删除的队头结点暂存给p
	*e = p->data;	//将与删除的队头结点赋给e
	Q->front->next = p->next;	//将原队头结点后继p->next赋值给头结点后继
	if (Q->rear == p)	//若队头是队尾，则删除后将rear指向头结点
		Q->rear = Q->front;
	free(p);
	return OK
}