LinkedList is linear data structure like arrays. Unlike array, elements of linked list are not stored at contigous memory location. Pointers are used to locate elements in linked list.
Why LinkedList?
- Size of the array is fixed. So you must know the upper limit on the number of elements in advacne.
- Inserting new element in array is expensive, because room has to be created for the new elements and to create room exising elements have to shifted.
Advantage over Arrays
- Dynamic size
- Ease of insertion/deletion
Drawback
- Random access is not allowed. We have to access elements sequentially starting from the first node.
- Extra memory space for a pointer is required.