LINKED LIST    A linked list is non-premitive data structure.  A  linked list  is a way to store a collection of elements. Like an array these can be character or integers. Each element in a linked list is stored in the form of a  node .   And a node is a collection of two sub-elements or parts , information or data part and another is address part .  A linked list is formed when many such nodes are linked together to form a chain. Each node points to the next node present in the order. The first node is always used as a reference to traverse the list and is called  Start or head and t he last node points to   NULL . Arrays can be used to store linear data of similar types, but arrays have some limitations as the size of the arrays is fixed: So we must know the upper limit on the number of elements in advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the usage. Inserting a new element in an array of elem