队列的封装

---

队列的封装

---

程序代码如下：

---

Queue.h

//封装队列

typedef int QDataType; 
//typedef struct BTNode* QDataType;

typedef struct QListNode
{
	struct QListNode* _pNext;
	QDataType _data;

}QListNode;

typedef struct Queue
{
	QListNode* _pFront;
	QListNode* _pBack;
}Queue;

void QueueInit(Queue* q);
void QueuePush(Queue* q, QDataType data);
void QueuePop(Queue* q);
QDataType QueueFront(Queue* q);
QDataType QueueBack(Queue* q);
int QueueSize(Queue* q);
int QueueEmpty(Queue* q);
void QueuePrint(Queue* q);

---

Queue.c

#include "Queue.h"
#include <stdio.h>
#include <assert.h>

QListNode* BuyListNode(QDataType data)
{
	QListNode* pNewNode = (QListNode*)malloc(sizeof(QListNode));
	if (NULL == pNewNode)
	{
		assert(0);
		return NULL;
	}
	pNewNode->_data = data;
	pNewNode->_pNext = NULL;
	return pNewNode;
}

//初始化(底层链表：带头结点的单链表)
void QueueInit(Queue* q)
{
	assert(q);

	q->_pFront = q->_pBack = BuyListNode(0);
}

//入队列
void QueuePush(Queue* q, QDataType data)
{
	assert(q);
	q->_pBack->_pNext = BuyListNode(data);
	q->_pBack = q->_pBack->_pNext;
}

//出队列
void QueuePop(Queue* q)
{
	assert(q);

	if (q->_pFront != q->_pBack)
	{
		QListNode* pDelNode = q->_pFront->_pNext;
		q->_pFront->_pNext = pDelNode->_pNext;
		free(pDelNode);
		pDelNode = NULL;
	}
}

//获取队头元素
QDataType QueueFront(Queue* q)
{
	assert(q);

	return q->_pFront->_pNext->_data;
}

//获取队尾元素
QDataType QueueBack(Queue* q)
{
	assert(q);

	return q->_pBack->_data;
}

//求队列的大小
int QueueSize(Queue* q)
{
	assert(q);

	int size = 0;
	QListNode* pCur = q->_pFront->_pNext;
	while (pCur)
	{
		size++;
		pCur = pCur->_pNext;
	}
	return size;
}

//判断队列是否为空
int QueueEmpty(Queue* q)
{
	assert(q);

	return 0 == QueueSize(q);
}

void QueuePrint(Queue* q)
{
	assert(q);

	QListNode* pCur = q->_pFront;
	while (pCur)
	{
		printf("%d->", pCur->_data);
		pCur = pCur->_pNext;
	}
	printf("NULL\n");
}

---

test.c

#include "Queue.h"
#include <stdio.h>
#include <stdlib.h>

void Test()
{
	Queue q;
	QueueInit(&q);
	QueuePush(&q, 1);
	QueuePush(&q, 2);
	QueuePush(&q, 3);
	QueuePush(&q, 4);
	QueuePush(&q, 5);
	QueuePrint(&q);
	printf("q->_Front = %d\n", QueueFront(&q));
	printf("q->_Back = %d\n", QueueBack(&q));
	printf("size = %d\n", QueueSize(&q));
	if (QueueEmpty(&q))
		printf("队列为空\n");
	else
		printf("队列非空\n");

	QueuePop(&q);
	QueuePop(&q);
	QueuePrint(&q);

}

int main()
{
	Test();
	system("pause");
	return 0;
}

---

程序运行结果如下：

---