单链表按值和按序号查找

#include<malloc.h>;
#include<stdio.h>;
typedef struct node{
     int data;
     struct node *next;
}NODE;

NODE *locate(NODE *head,int value){   /*按值查找*/

      NODE *p;
      p=head->next;
      while((p!=NULL)&&(p->data!=value)){
             p=p->next;
      }
      return p;
    }
NODE *find(NODE *head,int index){
     NODE *p;
     int skip=1;
     p=head->next;
     while((p!=NULL)&&(index<skip)){

         p=p->next;
         skip++;
     }
     return p;
}

NODE *create(){    /*创建连接表*/
  NODE *head,*p,*q;
  char ch;
  int a;
  head=(NODE*)malloc(sizeof(NODE)); /*开辟一个空间*/
  q=head;
  scanf("%d",&a);
  ch=getchar();
  while(ch!='?'){
    p=(NODE*)malloc(sizeof(NODE));
    p->data=a;
    q->next=p;
    q=p;
    scanf("%d",&a);
    ch=getchar();
  }
  q->next=NULL;
  return head;
}