Linked List

Linked lists are primarily a way to store data so that it can take up an arbitrary amount of space on the disk versus needing a set "block" of space on the disk like an array does.

There are two main kinds of link lists. The first kind of link list is known as a singly linked lists. In this set up the current node you are traversing only know's where the next node is in space and has no idea where the previous node is or where the end of the list might be. This is the simplest form of linked list.

The second kind of linked list is a doubly linked list. The set up for this kind of link is almost identical to the singly linked list except that a node that you're on will know where the previous node is located in addition to to where the next node is located.