It moves through the linked list. Let's say you have already set up 3 nodes.
Code:
root->next = node1, node1->next = node2;
So let's see what it does:
Code:
conductor = root;
if( conductor != NULL ) /* it's not... */
while( conductor->next != NULL ) /* it's not, conductor->next = node1, because root->next = node1, and conductor = root */
conductor = conductor->next; /* in makes conductor point node1 (the first time through) */
That loops until conductor points at node2, because at that point node2->next is NULL. So this loop finds the last node in the list.
Code:
if(conductor = NULL) {
That's wrong though. = assigns, == compares.
Quzah.