Definition
A Linked List is a linear collection of data element(where linearity is achieved by pointers in node) with following properties:.
- Each element of Linked list is called Node
- There is a pointer called start. Which contains address of first Node
- Each Node has atleast two part. 1st is data part another is pointer part. Data part contains actual data. and pointer part contains address of next Node.
- Pointer of Last Node of Linked List contains null.
Types of Linked List
- Simple Linked List
- Header Linked List
- Circular Linked List
- Two way Linked List
- Hybrid Linked List