32以下函数在head为头指针的具有头结点的单向链表中删除第1个结点， struct node int data, struct node next, }, typedef struct node NODE int delete(NODE head,int 1) { NODE p,*q, int J, q=head, J=0, while((q!=NULL)&&.((1) ) { (2) J十十， if(q==NULL) return(0), p=(3) (4) =p->next, free((5) return(1), 135632 在head 头指 有头 除第 struct node { mt data , struct node 祷next typedef struct node NODE mt delete(NODE祷head，mt 1) NODE 祷p 祷q » , mt J, q=head , J=O , whI1e«q' = NULL) &. &.( (1) (2) J++ , l{Cq==NULL) return(O) , p= (3 ) (4) free«5) , =p->next , ) , return(1 ) , 1356