单链表定义链式存储的队列

typedef int ElemType;

typedef struct LinkNode {  //链式队列节点
	ElemType data;
	struct LinkNode* next;
}LinkNode;
typedef struct {  //链式队列
	LinkNode* front, * rear;  //队列的队头和队尾指针
}LinkQueue;

//初始化
void InitQueue(LinkQueue& Q) {
	Q.front = Q.rear = (LinkNode*)malloc(sizeof(LinkNode)); //建立头结点
	Q.front->next = NULL;
}

//判空
bool QueueEmpty(LinkQueue Q) {
	if (Q.front == Q.rear) return true;
	else return false;
}

//队尾入队
bool EnQueue(LinkQueue& Q, ElemType x) {
	LinkNode* s = (LinkNode*)malloc(sizeof(LinkNode));
	s->data = x;
	s->next = Q.rear->next;
	Q.rear->next = s;
	Q.rear = s;
	return true;
}

//队头出队
bool DeQueue(LinkQueue& Q, ElemType& x) {
	if (Q.front == Q.rear) return false; //出队判队空
	LinkNode* p = Q.front->next;
	x = p->data;
	Q.front->next = p->next;
	if (Q.rear == p) Q.rear = Q.front;
	free(p);
	return true;
}