【数据结构与算法】链式队列的功能实现

#ifndef QUEUE_LIST_H
#define QUEUE_LIST_H
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

typedef struct Node
{
	void* data;
	struct Node* next;
}Node;
//创建节点
Node* create_node(void* data);

typedef struct QueueList
{
	Node* front;
	Node* rear;
}QueueList;

// 创建队列
QueueList* create_queue_list(void);

bool empty_queue_list(QueueList* queue);
// 入队
void push_queue_list(QueueList* queue,void* data);
//出队
bool pop_queue_list(QueueList* queue);
//查看对头
void* front_queue_list(QueueList* queue);
//查看队尾
void* rear_queue_list(QueueList* queue);
//队长
size_t size_queue_list(QueueList* queue);
//销毁
void destroy_queue_list(QueueList* queue);

#endif //QUEUE_LIST_H

#include "queue_list.h"

//创建节点
Node* create_node(void* data)
{
	Node* node = malloc(sizeof(Node));
	node->data = data;
	node->next = NULL;
	return node;
}

// 创建队列
QueueList* create_queue_list(void)
{
	QueueList* queue = malloc(sizeof(QueueList));
	queue->front = NULL;
	queue->rear = NULL;
	return queue;
}
//判断队空
bool empty_queue_list(QueueList* queue)
{
	return NULL == queue->front;
}

// 入队
void push_queue_list(QueueList* queue,void* data)
{
	Node* node = create_node(data);
	if(empty_queue_list(queue))
	{
		queue->front = node;
		queue->rear = node;
	}
	else
	{
		queue->rear->next = node;
		queue->rear = node;
	}
}
//出队
bool pop_queue_list(QueueList* queue)
{
	if(empty_queue_list(queue))
		return false;

	Node* temp = queue->front;
	queue->front = temp->next;
	free(temp);
	return true;
}
//查看对头
void* front_queue_list(QueueList* queue)
{
	return queue->front->data;
}
//查看队尾
void* rear_queue_list(QueueList* queue)
{
	return queue->rear->data;
}
//队长
size_t size_queue_list(QueueList* queue)
{
	size_t size = 0;
	for(Node* n=queue->front; NULL!=n; n=n->next,size++);
	return size;
}
//销毁
void destroy_queue_list(QueueList* queue)
{
	while(pop_queue_list(queue));
	free(queue);
}
/*测试
int main(int argc,const char* argv[])
{
	QueueList* queue = create_queue_list();
	for(int i=0; i<10; i++)
	{
		push_queue_list(queue,i);
		printf("rear:%d\n",rear_queue_list(queue));
	}
	while(!empty_queue_list(queue))
	{
		printf("front:%d\n",front_queue_list(queue));
		pop_queue_list(queue);
	}
	destroy_queue_list(queue);
}
*/