单链表C语言实现.pptVIP

* ⑴　建立单链表： # define NULL 0 typedef struct lnode{ int data; struct lnode *next; }lnode,*linklist; linklist l; void createlist_l() {int i,n; linklist p; l=(linklist)malloc(sizeof(lnode)); if(!l) {printf(”overflow memory);exit(0);} l-next=NULL; printf(please input how many elems do you want to put into the linklist:); scanf(%d,n); printf(\nplease these elems:); for(i=1;i=n;++i) {p=(linklist)malloc(sizeof(lnode)); if(!p) {printf(”overflow memory);exit(0);} scanf(%d,p-data); p-next=l-next;l-next=p;} } 输出单链表： void printlinklist() {linklist p; printf(\nnow the content of the linklist is:); p=l-next; while(p-next!=NULL) {printf(%d,,p-data); p=p-next;} printf(%d,p-data); } ⑵　访问线性链表的第i个结点： void getelem_l() {int j=1,i; linklist p=l-next; printf(\nplease input a place for getting:); scanf(%d,i); while(pji){p=p-next;++j;} if(!p) {printf(”i error);exit(0);} printf(the got elem is %d.,p-data); } ⑶　在线性链表的第i个结点之前插入一个数据为e的新结点： void listinsert_l() {linklist p=l; int j=0,i,e; linklist s; printf(\nple inp a place where you want to insert i and data for insert e:); scanf(%d %d,i,e); while(pji-1){p=p-next;++j;} if(!p) {printf(i error);exit(0);} s=(linklist)malloc(sizeof(lnode)); s-data=e;s-next=p-next;p-next=s;} ⑷　删除线性链表的第i个结点： void listdelete_l() {int j=0,i; linklist p=l,q; int e; printf(\nplease input a place where you want to delete i:); scanf(%d,i); while(p-nextji-1) {p=p-next;++j;} if(!p-next) {printf(”i error);exit(0);} q=p-next;p-next=q-next; e=q-data;free(q); printf(the deleted elem is %d.,e); } ⑸　求线性链表的长度： void listlength() {int j=0; linklist p=l; while(p-next!=NULL) {j++;p=p-next;} printf(\nthe length of the linklist is %d.,j); } *