队列的链式存储（C语言+一点点C++实现）

#include<stdio.h>
#include<stdlib.h>
struct Data
{
	int id;
};
struct Node
{
	Data data;
	Node* next;
};
Node* head = NULL;
struct QNode
{
	Node* front;
	Node* rear;
	
};
void in_quene(QNode* quene, Data data);
Data* out_quene(QNode* quene);
int main()
{
	QNode* quene = (QNode*)malloc(sizeof(QNode));
	quene->front = head;
	quene->rear = head;
	for (int i = 0; i <= 10; i++)
	{
		Data temp;
		temp.id = i;
		in_quene(quene, temp);
	}
	Data out = *out_quene(quene);

}
void in_quene(QNode* quene,Data data)
{
	
	//如果不是空队
	if (quene->rear)
	{
		Node* temp = (Node*)malloc(sizeof(Node));
		temp->data = data;
		temp->next = NULL;
		quene->rear->next = temp;
		quene->rear = temp;//队尾现在是temp了
	}
	//如果是空队
	else
	{
		Node* temp = (Node*)malloc(sizeof(Node));
		temp->data = data;
		temp->next = NULL;
		quene->front = temp;//队头队尾都是temp
		quene->rear = temp;
	}
}
Data* out_quene(QNode* quene)
{
	if (quene->front==NULL)
	{
		printf("队列中没有数据\n");
		return NULL;
	}
	else
	{
		Node* temp = quene->front;
		Data* return_temp = (Data*)malloc(sizeof(Node));
		*return_temp = quene->front->data;
		quene->front = quene->front->next;
		//如果删完了
		if (quene->front == NULL)
		{
			//rear也空了
			quene->rear = NULL;
		}
		
		free(temp);
		return return_temp;
	}
}