C language, linked list

#include"stdafx.h"#include<stdio.h>#include<stdlib.h>structnode{structnode*Next; intdata;}; typedefstructNode node;typedefstructNode LIST; LIST*creat_link_list (List *l,intN) {    inti; NODE*p =0; L= (node*)malloc(sizeof(NODE)); L->next =0;  for(i =0; I < n; i++) {p= (node*)malloc(sizeof(NODE)); printf ("input a data to is inserted:"); scanf ("%d", &p->data); P->next = l->Next; L->next =p; }    returnL;}intDelete_node (node*p) {//static int s_i =1;//printf ("Delete%d\n", s_i++);P->next =0;  Free(P); P=0; return 0;}intDelete_link_list (List *m) {NODE* PD = L->Next;  while(L->next! =0) {PD= l->Next; L->next = l->next->Next;    Delete_node (PD);    } delete_node (L); return 0;}intShow_link_list (List *L) {NODE* PS = l->Next; inti =0;  while(PS! =0) {printf ("node%d:%d,", ++i, ps->data); PS= ps->Next;    }; //do{//Error//printf ("node%d:%d,", ++i, ps->data);//PS = ps->next;//}while (Ps->next! = 0);    return 0;}intT2 () {NODE*l =0; intn =3; L=creat_link_list (L, N); printf ("\ncreat_link_list over\n");    Show_link_list (L); printf ("\nshow_link_list over\n");    Delete_link_list (L); printf ("\ndelete_link_list over\n"); return 0;}/*input a data to is inserted:1input a data to being inserted:2input a data to be inserted:3creat_link_list Overnode1:3,no De2:2,node3:1,show_link_list Overdelete_link_list over please press any key to continue ...*/

C language, linked list