c语言银行排队事件模拟

L)==TRUE?) { printf("链表为空!\n"); returnERROR; }?else { p=L->next; L->next=p->next;//保存数值*memorry=*p; free(p); return?OK; }}//遍历链表intListTraverse(EventListL)?{EventListp;?p=L;?while(p->next) { p=p->next;printf("时间:%d,类型:%d\n",p->OccurTime,p->NType); }printf("\n");returnOK;}/**********************队列相关函数******************************************///初始化队列QintInitQueue(LinkQueue*Q){Q->front=Q->rear=(QElemType*)malloc(sizeof(QElemType));if(!Q->front)?{printf("内存分配失败!\n");exit(-1);}Q->front->next=NULL;returnOK;}//若队列Q为空,返回TRUE,否则返回FALSEintEmptyQueue(LinkQueue*Q){if(Q->front==Q->rear)returnTRUE;elsereturnFALSE;}//若队列Q不为空,首结点出队,用memorry返回,并返回OK;否则返回ERRORintDelQueue(LinkQueue*Q,QElemType*memorry){QElemType*p;//节点指针if(?EmptyQueue(Q))?{?printf("队列为空,不能再进行出列操作!\n");?returnERROR;?}else?{?p=Q->front->next;