Types of Linked List 

Basically there are following four types of linked list.

1.       Linear list or singly linked list

2.       Two way linked list or doubly linked list

3.       Circular linked list

4.       Two way circular linked list

Singly Linked List

In a singly linked list, each node has one link field (next pointer field). Next pointer field contains the address of the next node in the list.

Doubly Linked List

In a doubly linked list, each node has two link field (next pointer and previous pointer). Next pointer field contains the address of the next node in the list and previous pointer contains the address of the previous node in the list. With this type of arrangement, coupling between each and every nodes of list becomes very strong.

Circular Linked List

A circular linked list is a singly linked list in which link field of the last node contains the address of the first node of the list, instead of NULL. With this type of arrangement, the coupling between each and every elements of the list becomes cyclic.

Two way circular linked list

A two way (doubly) circular linked list is one which has two link fields (next pointer and previous pointer) in circular manner.