数据结构之单链表（尾插法）查找、插入和删除

#include<stdio.h>
#include<malloc.h>
typedef struct node
{
int data;
struct node*next;
}node;
node*creat()
{
node*head,*q,*p;
char ch;
int a;
head=(node*)malloc(sizeof(node));
q=head;
ch='*';
puts("单链表尾插法，?结束");
while(ch!='?')
{
scanf("%d",&a);
p=(node*)malloc(sizeof(node));
p->data=a;
q->next=p;
q=p;
ch=getchar();
}
q->next=NULL;
return(head);
}
node*find(node*head,int x)
{
node*p;
p=head->next;
while((p!=NULL)&&(p->data!=x))
p=p->next;
return p;
}
void insert(node*p,int x)
{
node*q;
q=(node*)malloc(sizeof(node));
q->data=x;
q->next=p->next;
p->next=q;
}
void del(node*head,int x)
{
node*p,*q;
q=head;
p=q->next;
while((p!=NULL)&&(p->data!=x))
{
q=p;
p=p->next;
}
if(p==NULL)
{
printf("error\n");
}
else{
q->next=p->next;
free(p);
}
}
int main()
{
node*a,*b,*c;
int x,y;
a=creat();
printf("you want to find: ");scanf("%d",&x);
b=a;
b=find(a,x);
if(b!=NULL)
printf("\nfind the value:%d",b->data);
else
{
printf("error");
return -1;
}
printf("\ninput be inserted value: ");scanf("%d",&y);
printf("\ninsert the %d `s next",x);
insert(b,y);
c=a;
printf("\nprint the list\n");
while(a->next!=NULL)
{
a=a->next;
printf("%d ",a->data);
}
printf("\nyou want to del:");scanf("%d",&x);
del(c,x);
c=c->next;
printf("the new list:\n");
while(c!=NULL)
{
printf("%d ",c->data);
c=c->next;
}
return 0;
}