• What is linked list?
    • A linked list is a linear data structure where is element is a separate object. Each element(node) of a list comprises of two items - the date and a reference to the next code. The most powerful feature of Linked list is that it is of variable size.

picture ref : data Structure and algorithms by DS GUY


Linked List VS Array

1. Seperate Object : The node of Linked list is could be separated from the list. However, the cells of Array can't be separated. The Array itself is separated from other Array.
2. Variable Size : You can add, delete the node from Linked list. However, Array can't.
3. Random Access : You can access the each cell of Array by using index. But on the linked list, you have to loop over all the node to get the data you want.

Components of Linked List 

1. Node : Contains Data & Reference to the next Node.
2. Head : Reference to first node in the list.
3. Tail : Reference to last node of the list.

Types of Linked List

  • Single Linked List
    • In a singly linked list each node in the list stores the data of the node and a reference to the next node int the list. It does not store any reference to the previous node.
  • Circular Linked List
    • In the case of a circular doubly linked list, the only change thata occurs is that the end of the given list is linked to the front
  • Double Linked List
    • In double linked list each node contains two reference, that references to the previous and next node
  • Circular Double Linked List
    • The only change that occurs is that the end of the given list is linked back to the front of the list and vice versa.