2-) Insertion of a new element / Deletion of a existing element in an array of elements is expensive: The room has to be created for the new elements and to create room existing elements have to be shifted but in Linked list if we have the head node then we can traverse to any node through it and insert new node at the required position.
-Dynamic Array.-Ease of Insertion/Deletion.
A linked list is represented by a pointer to the first node of the linked list. The first node is called the head of the linked list. If the linked list is empty, then the value of the head points to NULL.Each node in a list consists of at least two parts:
-A Data Item (we can store integer, strings, or any type of data).
-Pointer (Or Reference) to the next node (connects one node to another) or An address of another node