链队列的表示与实现

#include<bits/stdc++.h>
using namespace std;
//  ---------------单链队列 ---------队列的链式存储结构
#define OK 1
#define ERROR 0
typedef int QElemType;
typedef int Status;
typedef struct QNode
{
    QElemType data;
    struct QNode *next;
}QNode, *QueuePtr;

typedef struct
{
    QueuePtr front;
    QueuePtr rear;
}LinkQueue;

Status InitQueue(LinkQueue &Q)
{
    Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
    if(!Q.front)
        exit(OVERFLOW);
    Q.front->next = NULL;
    return OK;
}

Status DestoryQueue(LinkQueue &Q)
{
    while(Q.front)
    {
        Q.rear = Q.front->next;
        free(Q.front);
        Q.front = Q.rear;
    }
    return OK;
}

Status EnQueue(LinkQueue &Q, QElemType e)
{
    QNode* p = (QueuePtr)malloc(sizeof(QNode));
    if(!p)
        exit(OVERFLOW);
    p->data = e; p->next = NULL;
    Q.rear->next = p;
    Q.rear = p;
    return OK;
}

Status DeQueue(LinkQueue &Q, QElemType &e)
{
    if(Q.front == Q.rear)
        return ERROR;
    QNode *p = Q.front->next;
    e = p->data;
    Q.front->next = p->next;
    if(Q.rear == p) Q.rear = Q.front; /!!!!
    free(p);
    return OK;
}

Status GetHead(LinkQueue Q, QElemType &e)
{
    QNode *p = Q.front->next;
    e = p->data;
}

bool Empty(LinkQueue Q)
{
    if(Q.front == Q.rear)
        return true;
    else
        return false;
}

int main()
{
    LinkQueue Q;
    InitQueue(Q);
    int n;
    cin >> n;
    while(n--)
    {
        int num;
        cin >> num;
        EnQueue(Q, num);
    }
    while(!Empty(Q))
    {
        int e;
        GetHead(Q, e);
        cout << e << endl;
        DeQueue(Q, e);
    }
    return 0;
}