Thread: Questions on Linked Lists

For the *next pointer, is it in charge of pointing to another node? In Linked Lists, a node means another identical structure right?

Yeah... it points to another node. And I'm not sure if they're always called nodes, but I think it could be possible (all these books of mine can't be wrong).

Is it compulsary to initialize the pointer of the first node to NULL each time?

Would seem to be. I would initialize the pointer of each newly created node to NULL though so when searching through, I can stop when I hit NULL.

Earlier on, the conductor pointer points to root (the first node). And the *next pointer was already set to NULL earlier. So it seems that the while loop will never run at all. Is this correct?

I would assume that when a new node is added, the root would be updated.

Besides, what does this entire while loop do?

It basically jumps down the list until the next object is NULL.

Lastly, what is the whole idea of Linked Lists? Is it a continuous replication of a structure until a NULL is encountered?

It's a type of storage container with certain advantages and disadvantages.

The biggest advantage that I see is that it allows new elements to be inserted/added almost instantly (whereas with arrays, all the elements below the one being added would have to be shifted down).

The biggest disadvantage is that you can't do random access. You have to jump down the nodes basically one at a time to reach the desired node.