队列C语言实现

队列和栈不同，它是一种先进先出的数据结构

以下是栈的链式存储实现：

typedef struct{
node_t *front;
node_t *rear;
int queue_size;
}queue_t;

int queue_creat(queue_t **queue)
{
 queue_t *queue1 = NULL;
 queue1 = (queue_t *)malloc(sizeof(queue_t));
 if(NULL == queue1)
 {
  printf("alloc mem failed!!\n");
 }
 queue1->front = queue1->rear =(node_t*)malloc(sizeof(node_t));
 if(NULL == queue1->front)
 {
  printf("alloc mem failed!!\n");
 }
 queue1->front->next = NULL;
 queue1->queue_size = 0;
 *queue = queue1;
 return 0;
}
void destory_queue(queue_t* name)
{
 node_t *node = NULL;
 while(name->front != name->rear)
 {
  node = name->front->next;
  name->front = node;
  free(node);
 }
 free(name);
}
int enqueue(queue_t *queue, node_t *element)
{
 if(NULL == queue || NULL == element)
 {
  printf("Error input.\n");
 }
 queue->rear->next = element;
 queue->rear = element;
 queue->queue_size++;
 return 0;
}

int dequeue(queue_t *queue, node_t **element)
{
 node_t *node = NULL;
 
 if(NULL == queue || NULL == element)
 {
  printf("Error input.\n");
 }
 if(queue->front == queue->rear)
 {
  printf("Queue is empty,can not dequeue.\n");
 }
 node = queue->front->next;
 queue->front->next = node->next;
 *element = node;
 queue->queue_size--;
 return 0;
}
int main()
{
 queue_t *new_q = NULL;
 node_t *node1, *node2;
 node1 = (node_t *)malloc(sizeof(node_t));
 node2 = (node_t *)malloc(sizeof(node_t));
 node1->id = 9; node2->id = 8;
 queue_creat(&new_q);
 enqueue(new_q, node1);
 printf("%d, %d\n", new_q->queue_size, new_q->rear->id);
 enqueue(new_q, node2);
 printf("%d, %d\n", new_q->queue_size, new_q->rear->id);
 destory_queue(new_q);
 return 0;
}