链队列-基本操作：初始化，判空，入队，出队，遍历链队列输出

                头文件

                结点,队列的定义

                初始化

                判空

                入队

                出队

                遍历

                完整代码

---

 头文件

#include <stdio.h>
#include<malloc.h>
#include<stdlib.h>

结点,队列的定义 

//结点
typedef struct Node
{
	int data;
	struct Node* pNext;
}NODE,*PNODE;
//队列
typedef struct Queue
{
	PNODE Front;
	PNODE Rear;
}QUEUE,*PQUEUE;

初始化

void init(PQUEUE pS)
{
	pS->Rear = (PNODE)malloc(sizeof(NODE));
	if (NULL == pS->Rear)
	{
		printf("动态内存分配失败\n");
		exit(-1);
	}
	else
	{
		pS->Front = pS->Rear;
		pS->Front->pNext = NULL;
	}
}

判空

bool empty(PSTACK pS)
{
	if (pS->pTop == pS->pBottom)
		return true;
	else
		return false;
}

入队

void enqueue(PQUEUE pS, int val)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if (NULL == pNew)
	{
		printf("动态内存分配失败\n");
		exit(-1);
	}
	pNew->data=val;
	pS->Rear->pNext = pNew;
	pNew->pNext = NULL;
	pS->Rear = pNew;
	return;
}

出队

bool dequeue(PQUEUE pS, int* val)
{
	if (is_empty(pS))
		return false;
	else
	{
		PNODE p = pS->Front->pNext;
		*val = p->data;
		p->pNext = pS->Front->pNext;
		free(p);
		p = NULL;
		return true;
	}
}

遍历

void traverse(PQUEUE pS)
{
	PNODE p = pS->Front->pNext;
	while (p!=NULL)
	{
		printf("%d ", p->data);
		p = p->pNext;
	}
	printf("\n");
	return;
}

完整代码

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include<malloc.h>
#include<stdlib.h>

//结点
typedef struct Node
{
	int data;
	struct Node* pNext;
}NODE,*PNODE;
//队列
typedef struct Queue
{
	PNODE Front;
	PNODE Rear;
}QUEUE,*PQUEUE;
void init(PQUEUE);//初始化
void enqueue(PQUEUE, int);//进队
void traverse(PQUEUE);//遍历
bool dequeue(PQUEUE, int*);//出队
bool is_empty(PQUEUE);//判空
void clear(PQUEUE);//清空
int main()
{
	QUEUE S;
	int val;
	init(&S);
	enqueue(&S, 3);
	enqueue(&S, 4);
	enqueue(&S, 5);
	traverse(&S);
	bool is_empty(PQUEUE pS);
	if (dequeue(&S, &val))
	{
		printf("出队成功，出队的元素是%d\n", val);
	}
	else
	{
		printf("出队失败!\n");
	}
	clear(&S);
	traverse(&S);
	return 0;
}




void init(PQUEUE pS)
{
	pS->Rear = (PNODE)malloc(sizeof(NODE));
	if (NULL == pS->Rear)
	{
		printf("动态内存分配失败\n");
		exit(-1);
	}
	else
	{
		pS->Front = pS->Rear;
		pS->Front->pNext = NULL;
	}
}


void enqueue(PQUEUE pS, int val)
{
	PNODE pNew = (PNODE)malloc(sizeof(NODE));
	if (NULL == pNew)
	{
		printf("动态内存分配失败\n");
		exit(-1);
	}
	pNew->data=val;
	pS->Rear->pNext = pNew;
	pNew->pNext = NULL;
	pS->Rear = pNew;
	return;
}

void traverse(PQUEUE pS)
{
	PNODE p = pS->Front->pNext;
	while (p!=NULL)
	{
		printf("%d ", p->data);
		p = p->pNext;
	}
	printf("\n");
	return;
}

bool is_empty(PQUEUE pS)
{
	if (pS->Front == pS->Rear)
		return true;
	else
		return false;
}
bool dequeue(PQUEUE pS, int* val)
{
	if (is_empty(pS))
		return false;
	else
	{
		PNODE p = pS->Front->pNext;
		*val = p->data;
		p->pNext = pS->Front->pNext;
		free(p);
		p = NULL;
		return true;
	}
}

void clear(PQUEUE pS)
{
	if (is_empty(pS))
		return;
	else
	{
		PNODE p, q;
		pS->Rear = pS->Front;
		p = pS->Front->pNext;
		pS->Front->pNext = NULL;
		while (p)
		{
			q = p;
			p = p->pNext;
			free(q);
		}
	}
}