List Reverse( List L ){ if(L==NULL) return; List head=(List)malloc(sizeof(struct Node)); head->Next=NULL; List q=L,p; while(q!=NULL) { p=q; q=q->Next; p->Next=head->Next; head->Next=p; } return head->Next;}