Chapter 7: Linked Lists

Benefits over Array

Don't need to pre-allocate space
Insertion is easier
- Insert/Delete element at beginning O(1)
- Insert/Delete elemenet at end O(n)
Traverse Linked List O(n)
Get element value O(n)

Double Linked List