/*main.cpp*/#include"linkqueue.h"intmain(){
LinkQueue lq;int i =0, e, state;
state =initQueue(&lq);if(state)printf("链队列初始化成功!\n");elseprintf("链队列初始化失败!\n");printf("向链队列中尾插元素!\n");while(1){printf("尾插第%d个元素:",++i);scanf("%d",&e);if(e ==-999)break;
state =pushQueue(&lq, e);if(!state){printf("插入失败!\n");break;}}printf("遍历队列中元素为:");traverseQueue(&lq, lqprint);printf("\n头删队列中一个元素!\n");
state =popQueue(&lq, e);printf("删除成功!删除的元素为%d\n", e);printf("遍历队列中元素为:");traverseQueue(&lq, lqprint);getHeadQueue(&lq, e);printf("\n队列头元素:%d\n\n", e);printf("清空队列!\n");clearQueue(&lq);printf("队列是否为空[1-空,0-不空]:%d\n",isEmptyQueue(&lq));printf("销毁队列!\n");destroyQueue(&lq);return1;}