Linked-List

- It is a collection of connected or arrangement of nodes in which each node is pointed or accessed by its previous node except first node. First node is pointed by special type of pointer variable named START.

Node

- Node is an user define datatype that can contains two parts.

1.) data - holds actual data of node.

2.) address - holds address if next or previous node.

Note : Start contains NULL when no node exists. Address part contains NULL when no next or previous node exists.

Types of link-list  

1.) Singly Linked-List

2.) Doubly Linked-List

3.) Circular Linked-List

a.) Singly Circular Linked-List

b.) Doubly Circular Linked-List