link_queue

#include <stdio.h>
#include <stdlib.h>
#define max 10
int rear = -1;


typedef struct queue
{
    int num;
struct queue * next;
}Queue;


typedef struct queue * Link;


enum return_result{full_ok = 1000,full_no,empty_ok,empty_no,
                   enqueue_ok,enqueue_no,dequeue_ok,dequeue_no};


void malloc_ok(Link *new_node)
{
*new_node = (Link)malloc(sizeof(Queue));
if(*new_node == NULL)
{
printf("create error!\n");
exit(-1);
}
}


void create_queue(Link *head)
{
(*head)->next = NULL;
}


void init_queue(Link *head)
{
rear = 0;
(*head)->next = NULL;
}


int is_full(Link *head)
{
if(rear == max)
{
return full_ok;
}
return full_no;
}


int enqueue_queue(Link *head,Link *new_node,int n)
{
Link tmp = *head; 
    if(is_full(head) == full_ok)
{
printf("the queue is full!\n");
return enqueue_no;
}
malloc_ok(new_node);
rear++;
while(tmp->next != NULL)
{
tmp = tmp->next;
}
tmp->next = *new_node;
(*new_node)->next = NULL;
    (*new_node)->num = n;
return enqueue_ok;
}


int is_empty(Link *head)
{
if((*head)->next == NULL || rear == -1)
{
return empty_ok;
}
return empty_no;
}


int dequeue_queue(Link *head)
{
Link tmp;
if(is_empty(head) == empty_ok)
{
printf("the queue is empty!\n");
return dequeue_no;
}
rear--;
tmp = (*head)->next;
    (*head)->next = tmp->next;
return tmp->num;
}
int main()
{
    Link head = NULL;
Link new_node = NULL;
int i;
int ret;


malloc_ok(&head);
create_queue(&head);
init_queue(&head);


for(i = 0;i < max;i++)
{
        enqueue_queue(&head,&new_node,i);
}


for(i = 0;i < max;i++)
{
ret = dequeue_queue(&head);
if(ret == dequeue_no)
{
break;
}
printf("queue[%d]=%d\n",i,ret);
}


    return 0;
}