Linked lists are a data structure that is heavily used because it can grow and shrink dynamically, and is only limited by the amount of memory available.
The Singly Linked List is the basic Linked List data structure. The other 3 types of Linked Lists are based off of the Singly Linked List Design. The links below will show the steps on how to insert and delete a node from the beginning, middle, and end of a singly linked list. These steps can be easily modified to apply to the other 3 types of Linked Lists.