Linked Lists
A linked list is a list of objects held in dynamically allocated memory, and connected to each other by some element such as a pointer.
A single element of a linked list is called a node.
Using dynamic memory makes linked lists flexible, allowing the program to add new nodes at any time.
But this also means that two nodes don’t necessarily sit right next to each other in memory. For this reason, each node includes a pointer which tells it where to find the next node.