单链表的创建插入和删除.docVIP

单链表的创建、插入和删除/（数据结构） SVS #in clude #in clude #in clude typedef int ElemType; typedef int Status; typedef struct LNode { ElemType data; struct LNode *n ext; }LNode,*Li nkList; void In itList_Li nk(Li nkList L) // 创建空链表 { L=(L in kList)malloc(sizeof(LNode)); L- next=NULL; } Status In sertList_Li nk(L in kList L,i nt i,ElemType e) 〃插入链表 { Lin kList s,p=L; int j=0; while(pji-1){p=p- next;j++;} if(!p||ji-1)return -1; s=(L in kList)malloc(sizeof(LNode)); s-data=e; s-n ext=p-n ext; p_n ext=s; return 1; \ / } Status DeleteList_Li nk(L in kList L,i nt i,ElemType e) // 删除链表 { Lin kList q,p=L;i nt j=0; w