Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at the contiguous location; the elements are linked using pointers.
A linked list is represented by a pointer to the first node of the linked list. The first node is called the head. If the linked list is empty, then the value of head is NULL.
Each node in a list consists of at least two parts: