[DS2] Types of Linked List

1. Singly Linked List

Each node has data and a pointer to the next node.

 

2. Doubly Linked List

Doubly Linked List has a pointer to the previous node. Thus, program can go in either direction : foward or backward.

3. Circular Linked List

A circular linked list is a variation of a linked list in which the last element is linked to the first element. A circular linked list can be either singly linked or doubly linked.

• for singly linked list, next pointer of last item points to the first item.
• In the doubly linked list, prev pointer of the first item points to the last item as well.