Week 5 Day 3

Lecture Outline

Linked Lists are the next data structure we are studying.
Linked Lists are a collection of nodes, nodes consist of (1) data, and (2) a pointer to a next node
A SinglyLinkedList only has pointers for the next node
Every linked list has a head, aka the start of the linked list
To traverse a linked list, we follow the trail of pointers that take us to each node, until we reach null
Write methods to add, remove, and print a linked list