C 单链表的顺序插入

最新推荐文章于 2024-04-29 08:00:00 发布

xjd34456

最新推荐文章于 2024-04-29 08:00:00 发布

阅读量593

点赞数

本文链接：https://blog.csdn.net/xjd34456/article/details/44958397

版权

思路：向单链表中插入一个新值，需要插入位置前后的两个节点。

从根节点开始遍历，寻找插入的正确位置。

struct node 
{
	int v;
	struct node *p; 
};
int fun (struct node **rootp,int val)
{
	struct node *current;
	struct node *previous;
	struct node *newp;

	current = *rootp;
	previous = NULL;
	newp = (struct node *)malloc(sizeof(struct node));

	if( newp == NULL)
		return 0;
	
	while( current != NULL &&  (current->v < val))
	{
		previous = current;
		current = current->p;
	}

	newp->v = val;
	newp->p = current;

	if(previous == NULL)
		*rootp = newp;
	else
		previous->p = newp;

	return 1;
}