int list_insert(Node **linkp, int newValue)
{
Node *current;
Node *newNode;
while (((current = *linkp) != NULL) && (current->value < newValue))
{
linkp = &(current->link);
}
newNode = (Node *)malloc(sizeof(Node));
if (newNode == NULL)
{
return FALSE;
}
newNode->value = newValue;
newNode->link = current;
*linkp = newNode;
return TRUE;
}单链表插入c语言实现
最新推荐文章于 2024-12-25 18:27:57 发布
1939

被折叠的 条评论
为什么被折叠?



