数据结构问题,关于队列的.Status EnQueue(LinkQueue &Q,QElemType e)//插入元素e为列队Q的新队尾元素 { p=(QueuePtr)mallco(sizeof(QNode));if(!p) exit(OVERFLOW);p->data=e;p->next=NULL;Q.rear->Next=p;Q.rear=p;return OK;}其中的if(!p)
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/29 18:39:49
![数据结构问题,关于队列的.Status EnQueue(LinkQueue &Q,QElemType e)//插入元素e为列队Q的新队尾元素 { p=(QueuePtr)mallco(sizeof(QNode));if(!p) exit(OVERFLOW);p->data=e;p->next=NULL;Q.rear->Next=p;Q.rear=p;return OK;}其中的if(!p)](/uploads/image/z/11456781-69-1.jpg?t=%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%97%AE%E9%A2%98%2C%E5%85%B3%E4%BA%8E%E9%98%9F%E5%88%97%E7%9A%84.Status+EnQueue%28LinkQueue+%26Q%2CQElemType+e%29%2F%2F%E6%8F%92%E5%85%A5%E5%85%83%E7%B4%A0e%E4%B8%BA%E5%88%97%E9%98%9FQ%E7%9A%84%E6%96%B0%E9%98%9F%E5%B0%BE%E5%85%83%E7%B4%A0+%7B+p%3D%28QueuePtr%29mallco%28sizeof%28QNode%29%29%3Bif%28%21p%29+exit%28OVERFLOW%29%3Bp-%3Edata%3De%3Bp-%3Enext%3DNULL%3BQ.rear-%3ENext%3Dp%3BQ.rear%3Dp%3Breturn+OK%3B%7D%E5%85%B6%E4%B8%AD%E7%9A%84if%28%21p%29)
xT[OA+ۗ~ 7R3kBAHl *UV6
Xffvy/^$O}ٝ3s;曱N#T]Ss0:ثxkNzP(ciO;Z^|
xBX0ƈ{彮yaGQJ2_pc呀 @ȮL[V8a2P/lA~_o4tLv!7l!RD(MNQ1JYzu<\Ze4x,7uyF