while(p->next & j<i-1)Ip=p->next: ++j: F if(!(p->next)Lj>i-1)return ERROR p->next=s->next turn o Status InitList L(LinkList &L) L =(Lnode *)malloc(sizeof (Lnode)) if (L)I L->next= NULL return OK int cmp(Event a, Event b) Status Order Insert_L(LinkList &L, ElemType e, int (*cmp)(Event a, Event b)) Lnode *p, *q (Lnode *)malloc(sizeof(Lnode)) if(! p)return(OVERFLOW) while(g->next & cmp(e, g->next->data)>0) q=q->next int EmptyList(LinkList L) t)return 1 return o LinkList Get Head (LinkList L)p = L; j = 0; while(p->next && j<i-1){p=p->next;++j;} if(!(p->next)||j>i-1) return ERROR; s = p->next; p->next = s->next; e = s->data; free(s); return OK; } Status InitList_L(LinkList &L) { L = (Lnode *)malloc(sizeof(Lnode)); if (L) { L->next = NULL; return OK; } else return ERROR; } int cmp(Event a, Event b); Status OrderInsert_L(LinkList &L, ElemType e, int (*cmp)(Event a, Event b)) { Lnode *p,*q; p=(Lnode *)malloc(sizeof(Lnode)); if(!p)return(OVERFLOW); p->data = e; q=L; while(q->next && cmp(e,q->next->data)>0) q=q->next; p->next = q->next; q->next = p; return OK; } int EmptyList(LinkList L) { if(!L->next) return 1; return 0; } LinkList GetHead(LinkList L)