Linked List is composed of a series of nodes.

The list is terminated when a node's link is null. The last node in this linked list is called the 'tailed node'. Respectively, the first node is called the 'head node'.

Since the nodes use links to denote the next node in the sequence, the nodes are not required to be sequentially located in the momery. These links also allow for quick insertion and removal of nodes. 

Common operations on a linked list may include:

• adding nodes
• removing nodes
• finding a node
• traversing (or traveling through) the linked list

Linked list needs some maintanance in order to add or remove nodes.