Intro To Linked Lists

A linked list is a data structure made up of a root and a series of nodes. The root holds the starting position of the linked list, while each node stores two things:

1. A value (data).

2. A reference (or pointer) to the next node in the list.

Instead of storing data in a fixed, ordered way like an array, a linked list builds its structure dynamically, one piece at a time. You can only move through it by following the pointers from one node to the next until you reach the end.