有序单链表的插入 C语言实现

"sll_node.h"
typedef struct NODE{
struct NODE *link;
int	    value;
} Node;

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

#define  FALSE  0
#defien  TRUE   1

int
sll_insert(register Node **linkp , int new_value)
{
register Node *current;
register Node *newnode;

/*
**寻找插入位置
*/
while( (current = *linkp) != NULL && current->value < new_value)
linkp = ¤t->link;

/*
** 为新节点分配内存,如果分配失败则返回FALSE
*/
newnode = (Node *)malloc( sizeof( Node ));
if( newnode == NULL)
return FALSE;
newnode->value = new_value;

/*
**将新节点插入链表中
*/
newnode->link = current;
*linkp = newnode;

return TRUE;
}