Thread: inserting nodes

I am trying to insert a node into list of ordered values let's say 1, 2,3

I can add the node when list is empty but I can't figured what to do add more nodes in list

Code:

 #include <stdio.h>

#include <stdlib.h>


struct node
{
	int data;
	struct node* next;
};	


void ADD ( struct node **Head, int value)
{
	
	
	if( *Head == NULL)
	{
		struct node *temp = malloc(sizeof(struct node));
	
		if(temp != NULL )       
		{ 
			temp -> data = value;
			temp -> next = NULL;
			*Head = temp;
		}	
	}
	
	else
	{
		
	}
}


int main ()
{
	struct node *head = NULL;
	
	ADD ( &head, 1);
	
	ADD ( &head, 2);
		
	return 0;
}

Originally Posted by king12

...
I can add the node when list is empty but I can't figured what to do add more nodes in list
...

Well first you have to find a way to walk down a list that contains nodes.
Second, you have to find a way to compare the values of the nodes with the value to insert.

Originally Posted by G4143

Well first you have to find a way to walk down a list that contains nodes.
.

head should be set to null when list is empty
Pointer of first node should be point to null when first node of list is created
Pointer of second node should be point to first node when second node is createdPointer of third node should be point to second node when third node is created