有序单链表的建立

从C和指针这本书上搬来的：

/***插入到一个有序地单链表，函数的参数是一个指**向链表第一个节点的指针以及需要插入的值。*/#include <stdio.h>#include <stdlib.h>#define TRUE    1#define FALSE   0typedef struct NODE{    struct NODE *next;    int value;}Node;int insert1(Node **first,int new_value){    Node *current = *first;    Node *pre = NULL;        Node *newNode;    newNode = (Node *)malloc(sizeof(Node));    if(newNode == NULL)        return FALSE;    newNode->value = new_value;        while(current != NULL && current->value < new_value)    //temp不为空,应在判断前！    {        pre = current;        current = current->next;    }                                                                                               newNode->next = current;    if(pre == NULL)             //新节点位于链表首部,包括空链表的情况        *first = newNode;            else                                       pre->next = newNode;       return TRUE;}/***消除链表首部这种特殊情况*/int insert2(Node **nextp,int new_value){    Node *current = *nextp;    Node *newNode;        newNode = (Node *)malloc(sizeof(Node));    if(newNode == NULL)        return FALSE;    newNode->value = new_value;        while((current= *nextp)!= NULL && current->value < new_value)    //temp不为空,应在判断前！    {        nextp = &(current->next);    }                                                                                               newNode->next = current;    *nextp = newNode;                       //所有情况一致性处理！         return TRUE;}/***测试用,输入无序整数，通过调用insert(),**建立有序链表，从而输出有序整数。*/int main(void){    Node *head = NULL;    Node *temp;    int count,value;        count = 5;                             //测试整数的个数    printf("请输入%d个整数:\n",count);    while(count--)    {        scanf("%d",&value);insert2(&head,value);    }        temp = head;    while(temp)    {        printf("%d ",temp->value);        temp = temp->next;    }    printf("\n");        return 0;}