【数据结构】队列的链表实现

Talk is cheap， show you the code.

#include <stdio.h>
#include <stdlib.h>

typedef struct node{
    int date;
    struct node * Next;
} Node;

typedef struct queue{
    Node * front;
    Node * rear;
}* LinkQueue;

LinkQueue CreateQueue()
{
    LinkQueue Queue;
    Queue = (LinkQueue)malloc(sizeof(struct queue));
    Queue->front = Queue->rear = NULL;  //初始队列中没有元素，所以首尾指针都置空
    return Queue;
}

void AddQ(LinkQueue Queue, int x)
{
    Node *AddNode;
    AddNode = (Node*)malloc(sizeof(Node));
    AddNode->date = x;
    AddNode->Next = NULL;
    if(!Queue->rear) //判断队列是否为空，若为空首尾指针都指向新节点
        Queue->front = Queue->rear = AddNode;
    else //若队列不为空，则向尾部添加新节点
        Queue->rear = Queue->rear->Next = AddNode;
}

int DeleteQ(LinkQueue Queue)
{
    int t;
    Node *Temp;
    if(!Queue->front){
        printf("队列已空\n");
        return;
    }
    else{
        Temp = Queue->front;
        Queue->front = Temp->Next;
        t = Temp->date;
        free(Temp);
    }
    if(!Queue->front) //检查删除操作后队列是否为空，若为空，则将首尾指针同时置空
        Queue->rear = NULL;
    return t;
}