struct linked_list { float age; struct linked_list *next; } struct Linked_list node1,node2;
This statement stores the address of node 2 into the field node1.next and this establishes a link between node1 and node2 similarly we can combine the process to create a special pointer value called null that can be stored in the next field of the last nodenode1.next=&node2;
A linked list is a dynamic data structure and therefore the size of the linked list can grow or shrink in size during execution of the program.
A linked list does not require any extra space therefore it does not waste extra memory.
It provides flexibility in rearranging the items efficiently.
The limitation of linked list is that it consumes extra space when compared to a array since each node must also contain the address of the next item in the list to search for a single item in a linked list is cumbersome and time consuming.