Linked list is one of the fundamental concepts in the data structure. It consists of a set of nodes, each containing a ‘data’ field and one or two references (pointing to adjacent nodes). It is a self referential datatype since it contains reference(s) of the adjacent (next or previous) datum of the same type.

Advantage :
Advantage of linked list compared to conventional array are

• Insertions and deletions of nodes can be done at anywhere in the list.
• List size can be increased and decreased in runtime.
• Order of the linked items can be different from how it is stored in memory or disk, thus allowing the list of items to be traversed in different order.

Types of linked lists exist are Singly linked list, Doubly linked list and Circular linked list.

Popularity: 1% [?]