What do you not get ? Linked lists are lists made up of links.
How to use linked lists:
Code:
void use_linked_list(node* start) {
node* mover = start;
while(mover != 0) {
// do something with mover->data
mover = mover->next;
}
}
How/why they work:
As stated in the tutorial each node has a data component and a link to the next node which in turn contains data and another link and so on. In order to be able to remember where the list start you create a root node which should not be modified and the end is symbolised by a null pointer. If you want to create a new node, you can just allocate memory to the "next" pointer. This works because you always have a pointer to the next element thus even though the elements aren't necessarily grouped like arrays, you still can access all the elements easily.
Why are they useful ?
In C++ I would much rather use std::vector or std::list. In C (or C style C++) it makes working with arrays which need to grow and reduce in size often easier (imo)