Following my previous article on arrays, I want to discuss the linked list data structure and some of its operations.
As data scientists, while we are not necessarily expected to know data structures and algorithms inside out, it is still a useful skill set for any technology professional.
That's why I'm creating a series of articles looking at core data structures and how they work internally.
Linked Lists are a type of data structure in which each element, called a node, is stored/operated in a sequence. However, they are not stored in memory contiguously like arrays.
Each node does two things:
- Data — The value that that node has.
- Reference — Points and contains the reference to the next node in the sequence.
