数据结构链表例题.docVIP

数据结构》第三章线性链表的基本制作代码　2007-04-16 13:46 /* Note:Your choice is C IDE */#include stdio.hstruct node{?int d;?struct node *next;};void initll(struct node **head) {?int x;?struct node *p,*q;?q=NULL;?scanf(%d,x);?while(x0)?{??p=(struct node *)malloc(sizeof(struct node));??p-d=x;??p-next=NULL;??if(q==NULL) *head=p;??else??q-next=p;??q=p;??scanf(%d,x);???}?}void menu(){?printf(**************************************\n);?printf(**????????????????????????????????? **\n);?printf(**??????????? 菜　　单????????????? **\n);?printf(**???????? ---------------????????? **\n);?printf(**??????? 1.? 链表初始化　　　　　　**\n);?printf(**??????? 2.? 链表插入? 　　　　　　**\n);?printf(**??????? 3.? 链表删除? 　　　　　　**\n);?printf(**??????? 4.? 链表输出? 　　　　　　**\n);?printf(**??????? 0.? 退?? 出?? 　　　　　　**\n);?printf(**??????? 请选择：);}void lloutput(struct node *head){?printf(链表的内容：);?while(head!=NULL)?{???? printf(%d\n,head-d);???? head=head-next;?}?}struct node *lookst(head,x)int x;struct node *head;{?struct node *p;?p=head;?while((p-next!=NULL)(((p-next)-d)!=x)) p=p-next;?return(p);}void inslst(head)struct node **head;{?int x,b;?struct node *p,*q;?printf(请输入插入位置的数值：);?scanf(%d,x);?printf(请输入插入的数值：);?scanf(%d,b); ?p=(struct node *)malloc(sizeof(struct node));?p-d=b;?if(*head==NULL)?{*head=p;p-next=NULL;return;}?if((*head)-d==x)?{p-next=*head;*head=p;return;}?q=lookst(*head,x);?p-next=q-next;q-next=p;?return;}void delst(struct node **head){?struct node *p,*q;?int x;?printf(请输入要删除的数值：);?scanf(%d,x);?if(*head==NULL)?{printf(链表是空表！);return;}?if(((*head)-d)==x)?{p=(*head)-next;free(*head);*head=p;return;}?q=lookst(*head,x);?if(q-next==NULL)?{printf(链表中没有相应的节点！\n);return;}?p=q-next;q-next=p-next;?free(p);?return;} main(){?int ch;?struct node *head,*p,*q;?? ??? menu();??? scanf(%d,ch);??? while(ch!=0)??? {?????? switch(ch)?????? {?????? ?case 1:initll(head);break;?????? ?case 2:inslst(head);break;?????? ?case 3:delst(head);break;????