data structures using points to remember linked list is linear collection of data elements called as nodes in which linear representation is given by links from one node to another linked list is data structure which can be used to implement other data structures such as stacksqueuesand their variations before we insert new node in linked listswe need to check for overflow conditionwhich occurs when no free memory cell is present in the system before we delete node from linked listwe must first check for underflow condition which occurs when we try to delete node from linked list that is empty when we delete node from linked listwe have to actually free the memory occupied by that node the memory is returned back to the free pool so that it can be used to store other programs and data in circular linked listthe last node contains pointer to the first node of the list while traversing circular linked listwe can begin at any node and traverse the list in any direction forward or backward until we reach the same node where we had started doubly linked list or two-way linked list is linked list which contains pointer to the next as well as the previous node in the sequence thereforeit consists of three parts--dataa pointer to the next nodeand pointer to the previous node the prev field of the first node and the next field of the last node contain null this enables to traverse the list in the backward direction as well thusa doubly linked list calls for more space per node and more expensive basic operations howevera doubly linked list provides the ease to manipulate the elements of the list as it maintains pointers to nodes in both the directions (forward and backwardthe main advantage of using doubly linked list is that it makes search operation twice as efficient circular doubly linked list or circular two-way linked list is more complex type of linked list which contains pointer to the next as well as previous node in the sequence the difference between doubly linked and circular doubly linked list is that the circular doubly linked list does not contain null in the previous field of the first node and the next field of the last node ratherthe next field of the last node stores the address of the first node of the list similarlythe previous field of the first field stores the address of the last node header linked list is special type of linked list which contains header node at the beginning of the list soin header linked list start will not point to the first node of the list but start will contain the address of the header node multi-linked lists are generally used to organize multiple orders of one set of elements in multilinked listeach node can have number of pointers to other nodes exercises review questions make comparison between linked list and linear array which one will you prefer to use and when why is doubly linked list more useful than singly linked list give the advantages and uses of circular linked list specify the use of header node in header linked list give the linked representation of the following polynomial xy explain the difference between circular linked list and singly linked list form linked list to store studentsdetails use the linked list of the above question to insert the record of new student in the list delete the record of student with specified roll number from the list maintained in question given linked list that contains english alphabet the characters may be in upper case or in lower case create two linked lists--one which stores upper case characters and the other that stores lower case characters