1. Linked Lists: the Basics

Abstraction: a sequence of elements

Arrays (and vectors) work by storing elements of a sequence contiguously in memory
- Easy to access elements by number
- Inserting things into the middle is slow and awkward
Linked lists store each element in a distinct node. Nodes are linked by pointers.
- Accessing elements by number is slow and awkward
- Easy to insert things into the middle

struct LinkedListNode {
   DataType data;
   LinkedListNode* next;
};
LinkedListNode* firstNode;


Linked Lists	\| \|	1.1. Traversing Linked Lists