数据结构之链表实现队列

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
typedef struct Node
{
int data;
struct Node *next;
}Node,*Lnode;
typedef struct queue
{
Lnode front, rear;
}queue,*Queue;

int Create_Queue(Queue Q)
{
Q->front = Q->rear = (Lnode)malloc(sizeof(Node));
if(!Q->front )
exit(0);
Q->rear ->next =NULL;

return OK;
}

int En_Queue(Queue Q,int item)
{
Lnode pew = (Lnode)malloc(sizeof(Node));
if(!pew)
exit(0);

pew->data = item;
Q->rear ->next = pew;
Q->rear = pew;
pew->next =NULL;

return OK;
}

int pop_Queue(Queue Q,int *item)
{
Lnode pew;

if(Q->front ==Q->rear )
{
return 0;
}
pew = Q->front ->next ;
*item = pew->data ;
Q->front ->next = pew->next ;
printf("%d\n",*item);
if(pew==Q->rear )
Q->rear = Q->front ;
free(pew);

return OK;
}
int main()
{
queue Q;
int item;
Create_Queue(&Q);
for(int i = 0;i<10;++i)
En_Queue(&Q, i);
for(i = 0;i<20;++i)
pop_Queue(&Q,&item);

return 0;
}

转载于:https://www.cnblogs.com/muzixiaofeng/p/10088663.html