Data structure and the operation of the algorithm chain list

tepedef struct node{int date;struct Node *next;} list;//creates a list of void creatlist (list **ptrl) {(**ptrl) = (list*) malloc (sizeof (list));(*list)->next=null;} Find length int length (list *ptrl) {list *p=ptrl;int j=0;while (p) {p=p->next;j++;} return J;} Find int findlist (list *ptrl,int k) {list *p=ptrl;int i=1;while (p!=null&&i<k) {p=p->next;i++}if (i=k) by ordinal return P;elsereturn NULL;} Find list *find by value (int x,list *ptrl) {list *p=ptrl;while (p!=null&&p->date!=x) P=p->next;return p;} Insert list* insertlist (int *e,list *ptrl,int i) {list *p,*s;if (i==1)//Insert element in table header {s= (list*) malloc (sizeof (List));s->    Date=x;s->next=ptrl;return s;}    P=find (I-1,ptrl)//If the element to be inserted is empty then return if (p==null) {printf ("Canshucuowu");    return NULL;    } else {s= (list*) malloc (sizeof (List));//insert Operation s->date=x;    s->next=p->next;    p->next=s;    return Ptrl; }}//List deletion list* delsetelist (int *e,list *ptrl,int I,) {List *p,*s; if (i==1) {S=ptrl; if (ptrl!=null) ptrl=ptrl->next; ElseRuturn NULL; Free (s); return Ptrl;     } p=find (I-1,ptrl) if (p==null) {printf ("bucunzia1"); return;  } else {s=p->next; p->next=s->next; free (s); } }

Data structure and the operation of the algorithm chain list