Linked List
Sequential list of elements, similar to an arrray, but the sequence of elements (called nodes) can be easily rearranged by changing the links between the nodes.
Can change in size while the program runs.
To delete a node, we can reroute the links to bypass the node (in an array, we would need to copy elements).
E.g., word processor line cut and paste (each line is a node)
Travel from a head link to the end (or in both directions if double linked list)