```
#define MAXQSIZE 100
typedef struct
{ int base[MAXQSIZE];
int front;
int rear;
} Sqqueue;
Sqqueue enqueue(Sqqueue Q,int e)/队列的入队函数/
{ if ((Q.rear+1)%MAXQSIZE==Q.front)
printf("ERROR\n");
else
{Q.base[Q.rear]=e;
____________________;
}
return Q;
}
Sqqueue dequeue(Sqqueue Q,int *e)/队列的出队函数/
{ int x;
if (Q.front==Q.rear)
printf("ERROR\n ");
else
{ ____________________;
____________________;
}
return Q;
}
void display(Sqqueue Q)/队列元素输出函数/
{ int k,m;
k=Q.front;m=Q.rear;
while(k!=m)
{ printf("%4d",Q.base[k]);
k=(k+1)%MAXQSIZE;}
printf("\n");
}
main()/主函数/
{ Sqqueue Q;
Q.rear=Q.front=0; /初始化顺序队列,使其成为空队列/
printf("\nplease input the length:");/请求输入队列的长度/
scanf("%d",n);
printf("please input create data:\n ");/请求输入队列中各个元素/
for(i=1;i<=n;i++)```