Following my previous article on arrays, I need to debate the linked list data structure and a few of its operations.
As data scientists, though we will not be necessarily expected to know data structures and algorithms inside-out, it’s still a handy skill set for any tech skilled.
That’s why I’m making a series of articles discussing the central data structures and the way they work under the hood.
Linked lists are a kind of data structure wherein each element, called a node, is stored/works in a sequence. Nevertheless, they will not be stored in memory contiguously like arrays.
Each node has two things:
- Data — The worth held by that node
- Reference — Points and incorporates the reference to the following node within the sequence.
