Question

This is a code for linked list, it is about adding a node in the middle of a list, I am really confused why int i = 2? can't it be 0?

Add to the Middle • Allocate memory and store data for new node Traverse to node just before the required position of new node Change next pointers to include new node in between struct node *newNode; newNode = malloc(sizeof(struct node)); newNode->data = 4; struct node *temp head; for(int i=2; i < position; i++) { if(temp->next != NULL) { temp temp->next; pole } newNode->next temp->next; temp->next newNode; =

Answer 1

for(int i=2;i<position;i++)

Here i is starting with 2 because of following reasons:-
1. As you say why it can't be 0 because Here we are traversing the
linklist not array and i=1 means first element of the linked list
i=2 is second element in the linked list.
2. For adding the node in the middle of list, List must have more than
or equal to 2 element. Suppose the least element possible for linkedlist
is 2 and the middle position is also second position. So according to the
loop i=2 is false(because pos=2) and newNode is inserted after head(first node).
  
It is confusing because you are trying to deal with the indexed but here no
element is access using their index.
The above loop is just for traversing the linkedlist element and find the
desired position.