Linked Lists (cont)
Linked lists are more flexible than arrays:
- values do not have to be adjacent in memory
- values can be rearranged simply by altering pointers
- the number of values can change dynamically
- values can be added or removed in any order
Disadvantages:
- it is not difficult to get pointer manipulations wrong
- each value also requires storage for
next pointer
|