LinkList_Queue（链式队列）

#include<stdio.h>
typedef int Datatype;
typedef struct link_node {
Datatype info;
struct link_node *next;
}node;
typedef struct Queue {
node *front, *rear;
}queue;


queue *init()
{
queue *q;
q = (queue *)malloc(sizeof(queue));
node *n = (node *)malloc(sizeof(node));
n->next = NULL;
q->front = n;
q->rear = n;
return q;
}


int empty(queue *q)
{
if (q->front->info == NULL)
return 1;
else
return 0;
}


void display(queue *q)
{
if (!q->front)
printf("栈为空，无法进行输出！\n");
else
{
node *p = q->front;
while (p)
{
printf("%5d", p->info);
p = p->next;
}
}
}


queue *insert(queue *q, Datatype x)
{
node *p, *l=q->rear;
p = (node *)malloc(sizeof(node));
p->info = x;
p->next = NULL;
if (!empty(q))
q->front=q->rear = p;
else
{
q->rear->next = p;
q->rear = p;
}
return q;
}




queue *dele(queue *q)
{
queue *p = q;
if (!p)
printf("栈为空，无法进行删除！\n");
else
{
node *n = q->front;
q->front = q->front->next;
free(n);
}
return q;
}


void main()
{
queue *Q;
Q = init();
int i;
for (i = 0; i<10; ++i)
Q = insert(Q, i*2);
display(Q);
putchar('\n');
printf("队头结点的值为：%d\n", Q->front->info);
Q = insert(Q, 666);
printf("666进队：");
display(Q);
putchar('\n');
Q = dele(Q);
printf("删除队头的结点后为：");
display(Q);
putchar('\n');
Q = dele(Q);
printf("删除队头的结点后为：");
display(Q);
putchar('\n');
}