C语言数据结构——链式队列

talk is  cheap,show me the code

code:

#include <iostream>
using namespace std;

typedef struct chain
{
	int num;
	struct chain *next;
	
}chain,*pchain;

typedef struct chain_queue
{
	pchain front;
	pchain rear;
}que,*pque;

void init(pque pque1)
{
	pque1->front = (pchain)malloc(sizeof(chain));
	pque1->rear = pque1->front;
}
void en_queue(pque pque1,int num)
{
	pchain temp = (pchain)malloc(sizeof(chain));
	temp->num = num;
	pque1->rear->next = temp;
	pque1->rear = temp;

}
void de_queue(pque pque1)
{
	pchain temp = (pchain)malloc(sizeof(chain));
	temp = pque1->front;
	pque1->front = pque1->front->next;
	free(temp);
	temp = NULL;
}
void bianli(pque pque1)
{
	pchain temp = pque1->front->next;
	while (temp != pque1->rear->next)
	{
		cout <<temp->num<< endl;
		temp = temp->next;
	}
}
void clear(pque pque1)
{
	while (pque1->front != pque1->rear)
	{
		pchain temp = pque1->front;
		pque1->front = pque1->front->next;
		free(temp);
	}
}



int main()
{
	que que1;
	init(&que1);
	en_queue(&que1, 5);
	bianli(&que1);
	de_queue(&que1);
}