Linked List
Generally a Linked List means "Singly Linked List". It is a chain of records known as Nodes . Each node has at least two members, one of which points to the next Node in the list and the other holds the data. Figure 1: Singly Linked List Basically Single Linked Lists are uni-directional as they can only point to the next Node in the list but not to the previous. We use below structure for a Node in our example. struct Node { int Data; struct Node *Next; }; Variable Data holds the data in the Node (It can be a pointer variable pointing to the dynamically allocated memory) while Next holds the address to the next Node in the list. Figure 2: Node in a Singly Linked List Head is a pointer variable of type struct Node which acts as the Head to the list. Initially we set ' Head ' as NULL which means list is empty. Basic Operations on a Singly Linked List Traversing a List Inserting a Node in the List Deleting a Node from the List Travers...