链队列的建立及操作

#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;

//链队列的存储结构
typedef struct Node
{
    ElemType data;
    struct Node *next;
}Node,*LinkList;

typedef struct
{
    LinkList front,rear;
}LinkQueue;

//链队列的入队操作
int EnQueue(LinkQueue *Q,ElemType e)
{
    LinkList s;
    s=(LinkList)malloc(sizeof(Node));
    s->data=e;
    s->next=NULL;
    Q->rear->next=s;
    Q->rear=s;
    return 1;
}

//链队列的出队操作
int DeQueue(LinkQueue *Q,ElemType *e)
{
    LinkList p;
    if(Q->front==Q->rear)
        return 0;
     p=Q->front->next;
    *e=p->data;
    Q->front->next=p->next;
    if(Q->rear=p)
        Q->rear->next=Q->front;
    free(p);
    return 1;
}

int main()
{
    return 1;
}