anil sharmalovely professional university unit linked lists notes contents objectives introduction concept of linked lists representation of linked list inserting node using recursive programs deleting the specified node in singly linked list inserting node after the specified node in singly linked list linked list common errors doubly linked lists circular linked list sorting and reversing linked list merging two sorted lists merging of two circular lists application of linked list summary keywords self assessment review questions further readings objectives after studying this unityou will be able todefine linked lists describe linked lists representation know doubly linked lists explain circular linked lists introduction there are many other operations that are also useful to apply to sequences of elements thus we can form wide variety of similar adts by utilizing different packages of operations any one of these related adts could reasonably go by the name of list howeverwe fix our attention on one particular list adt whose operations give representative sampling of the ideas and problems that arise in working with lists lovely professional university