A linked list maintains the memory location of each item in the list by using a series of ‘pointers’ within the data structure.
Every node of a singly-linked list contains the following information:
- Data element (user’s data);
- A link to the next element (auxiliary data).
A number of pointers are required, these are:
- The start pointer’ points to the first node in the list.
- The last node in the list has a ‘null pointer’ (which is an empty pointer)
- Each node has a pointer providing the location of the next node in the list.
