队列顺序存储操作6种算法.docVIP

#include?stdio.h#include?stdlib.htypedef?int?elemType;/************************************************************************//*??????????????????????以下是关于队列顺序存储操作的6种算法???????????????*//************************************************************************/struct?queue{????elemType?*queue;????????/*?指向存储队列的数组空间?*/????int?front,?rear,?len;????/*?队首指针（下标），队尾指针（下标），队列长度变量?*/????int?maxSize;????????????/*?queue数组长度?*/};void?againMalloc(struct?queue?*q){????/*?空间扩展为原来的2倍，原内容被自动拷贝到p所指向的存储空间中?*/????elemType?*p;????p?=?realloc(q-queue,?2?*?q-maxSize?*?sizeof(elemType));????/*?动态