# A Brief Introduction To Linked Lists

A brief introduction to Linked List

A Linked Lists is a linear data structure that consists of a group of nodes. Unlike an array, it has elements that are stored in random memory locations.

Each node contains two fields:

• data stored at that particular address.
• The pointer contains the address of the next node.

The last node of the Linked list contains a pointer to null to represent the termination of the linked list. Generally, we call the first node as the head node and the last node as the Tail node in Linked List.

## Why Linked List Over Array?

The array contains the following limitations:

• The size of an array is fixed. We must know the size of the array at the time of its creation, hence it is impossible to change its size at runtime.
• Inserting a new element in an array of elements is expensive because we need to shift elements to create room for new elements to insert.
• Deleting an element in an array is also expensive as it also takes the shifting of elements in the array.

• Insertion and deletion operations can be implemented very easily and these are not costly as they do not require shifting of elements.
• They are dynamic in nature. Hence, we can change their size whenever required.
• Stacks and queues can be implemented very easily using Linked Lists.

• Random access of an element is not possible in Linked Lists, we need to traverse Linked List from starting to search an element into it.
• It is relatively slow to process in comparison to an Array.
• Since node of a Linked List contains both data and pointer to the next node, hence extra memory is required to store the pointer of each node.

There are three types of Linked Lists:

A Singly Linked List contains a node that has both the data part and pointer to the next node. The last node of the Singly Linked List has a pointer to null to represent the end of the Linked List. Traversal to previous nodes is not possible in singly Linked List i.e We can not traverse in a backward direction.

Circular Linked List is similar to singly Linked List but the last node of singly Linked List has a pointer to node which points to the first node (head node) of Linked List.