Queue--队列(c语言简单实现)

#include<stdlib.h>
typedef char ele;
typedef struct node{
    ele e;
    struct node     qnode;
}QNode,*Qptr;

typedef struct{
    Qptr front;
    Qptr rear;
}Queue;

//初始化空队列
void initQueue(Queue *q){
    q->front=q->rear=(QNode *)malloc(sizeof(QNode));
    if(!q->front)exit(0);
    q->front->qnode=NULL;
}

//插入队列
void insert(Queue *q,ele e){
    QNode node = (QNode *)malloc(sizeof(QNode));
    if(!node)exit(0);
    node->e=e;
    node->qnode=NULL;
    q->rear->qnode=node;
    q->rear=node;
}

//out queue
ele delQueue(Queue *q){
    if(q->front==q->rear)return NULL;
    QNode node = q->front->qnode;
    ele e = node->e;
    q->front->qnode=node->qnode;
    if(q->rear==q)q->rear=q->front;
    free(node);
    return e;
}

//clear queue
void clearQueue(Queue *q){
    if(q->front==q->rear)return ;
    while(q->front!=q->rear){
        QNode node = q->front->qnode;
        q->front->qnode = node->qnode;
        free(node);
    }
}