链队列的基本操作

#include<bits/stdc++.h>

using namespace std;

typedef int Status;
typedef int QElemType;

#define OK 1
#define ERROR 0
#define OVERFLOW -2

typedef struct QNode{
   
    QElemType data;
    struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
   
    QueuePtr front;
    QueuePtr rear;
}LinkQueue;

//1.初始化队列
Status InitQueue(LinkQueue &Q){
   
    Q.front=Q.rear=new QNode;
    Q.front->next=NULL;
    cout<<"初始化成功"<<endl;
    return OK;
}

//2.销毁队列
Status DestoryQueue(LinkQueue &Q){
   
    while(Q.front){
   
        Q.rear=Q.front->next;
        delete Q.front;
        Q.front=Q.rear;
    }
    cout<<"销毁成功"<<endl;
    return OK;
}

//3.清空队列
Status ClearQueue(LinkQueue &Q){
   
    Q.rear=Q.fron