Linked List

It is a sequence of data structure in which different nodes are connected to each other with the help of links(pointer) .

There are various types of Linked List

1) Singly Linked List

2) Double Linked List

3) Circular Linked List

     a) Singly Circular Linked List

     b) Doubly Circular Linked List

1) Singly Linked List

In this list, each node has 2 parts one is data part :- it stores data of that node

another is pointer (next) which links one node to its next node

2) Doubly Linked List

In this list, each node has 3 parts one is data part :- it stores data of that node

second is a pointer (next) which links one node to its next node

and third is another pointer (prev) which links one node to its previous node