in the next sectionwe explore the construction and management of singly linked list independent of its use in the implementation of any specific adt in later sections we then present examples to show how linked lists can be used to implement abstract data types we also include number of exercises at the end of the that provide practice in the construction and management of singly linked lists external references we use the term external reference to indicate those reference variables that point to node but are not themselves contained within node as is the case with the link fields some external references must be permanent or exist during the lifetime of the linked list in order to maintain the collection of nodes others are only needed on temporary basis in order to perform specific operation these temporary external references should be local variables that disappear after the function or method has completed note the singly linked list singly linked list is linked list in which each node contains single link field and allows for complete traversal from distinctive first node to the last the linked list in figure is an example of singly linked list there are several operations that are commonly performed on singly linked listwhich we explore in this section to illustrate the implementation of these operationsour code assumes the existence of head reference and uses the listnode class defined earlier the data fields of the listnode class will be accessed directly but this class should not be used outside the module in which it is defined as it is only intended for use by the linked list implementation traversing the nodes in the earlier examplewe accessed the second and third nodes of our sample list by stringing together the next field name off the external reference variable this may be sufficient for lists with few nodesbut it' impractical for large lists insteadwe can use temporary external reference to traverse through the listmoving the reference along as we access the individual nodes the implementation is provided listing the process starts by assigning temporary external reference curnode to point to the first node of the listas illustrated in figure (aafter entering the loopthe value stored in the first node is printed by accessing the data component stored in the node using the external reference the external reference is then advanced to the next node by assigning it the value of the current node' link fieldas illustrated in figure (bthe loop iteration continues until every node in