c语言链表操作

# include <stdio.h>
# include <stdlib.h>




typedef int ElemType;


typedef struct LinkNode{
ElemType vlue;
struct LinkNode *next;
}LinkNode,*LinkList;


//create linklist
LinkList create_Linklist(int elem){
LinkList head;
head = (LinkList)malloc(sizeof(LinkNode));
if(!head)
exit(EXIT_FAILURE);
head->value = elem;
head->next = NULL;
return head;
}


//tail unsort  insert
void Insert_Tail(LinkList head,int elem){
if(!head)
head = Create_Linklist(elem);
else{
LinkList temp = head;
while(temp->next)
temp = temp->next;
temp->next = create_Linklist(elem);
}
}
//recursion insert in order
void InsertSorted(LinkList head,int elem){
if(head == NULL || head->value>=elem){
LinkList temp = create_Linklist(elem);
temp->next = head;
head = temp;
}
else InsertSorted(head->next,elem);
}
//print
void print(LinkList head){
while(head){
printf("%d ",head->value);
head = head->next;
}
}
//source code
int main(){
LinkList linkTest;
int testNum;
printf("enter test number \n");
scanf("%d",&testNum);
linkTest = create_Linklist(testNum);
print(linkTest);
printf("%s\n",linkTest);
InsertSorted(linkTest,--testNum);
//Insert_Tail(linkTest,++testNum);
//Insert_Head(linkTest,++testNum);
printf("link after insert: \n");
print(linkTest);
system("pause");
return 0;
}