链表队列的销毁

#include<iostream>

#define MAXSIZE 10

#define error 0

#define OK 1

using namespace std;

typedef int Elemtype;

typedef struct QNode/*定义节点*/

{

Elemtype data;

struct QNode *next;

}QNode,*QueuePtr;

typedef struct /*定义队列*/

{

QueuePtr front;

QueuePtr rear;

}LinkQueue;

int initqueue(LinkQueue &Q)/*初始化队列*/

{

Q.rear=Q.front=new QNode;

if(!Q.front) cout<<"error"<<endl;

return error;

Q.front->next=NULL;

return OK;

}

int DestroyQueue(LinkQueue &Q)/*销毁队列*/

{

while(Q.front)

{

Q.rear=Q.front->next;

free(Q.front);

Q.front=Q.rear;

}

return OK;

}

int main()

{

LinkQueue q;

initqueue(q);

DestroyQueue(q);

return 0;

}