单链队列的实现

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define MAXSIZE 100
#define ElemType int
typedef struct qnode{
    ElemType data;
    struct qnode *next;
}DataNode;

typedef struct{
    DataNode *head;
    DataNode *rear;
}LinkQuNode;

void InitQueue(LinkQuNode *q)
{
    q->head=q->rear = (DataNode *)malloc(sizeof(DataNode));
    q->head->next =NULL;
}
void enQueue(LinkQuNode &q,ElemType e)
{
    DataNode *p;
    p= (DataNode *)malloc(sizeof(DataNode));
    p->data = e;
    p->next = NULL;
     q.rear->next = p;
        q.rear = p;
}

int deQueue(LinkQuNode &q,ElemType &e)
{   DataNode *p;
        if(q.head==q.rear)
         return 0;
         p = q.head->next;
         e = p->data;
         q.head->next = p->next;
         if(q.rear == p)
            q.rear = q.head;
        free(p);
        return 1;

}
int main(){
    LinkQuNode Q;
    int e;
    int i;
    InitQueue(&Q);
     for(i=0;i<5;i++)
        enQueue(Q, i);
    for( i=0; i<5;i++){
        deQueue(Q,e);
        printf("%d",e);
    }


    return 0;
}