deleting an item at the beginning of list involves setting first to point to first next to traverse linked listyou start at first and then go from link to linkusing each link' next field to find the next link link with specified key value can be found by traversing the list once foundan item can be displayeddeletedor operated on in other ways new link can be inserted before or after link with specified key valuefollowing traversal to find this link double-ended list maintains pointer to the last link in the listoften called lastas well as to the first double-ended list allows insertion at the end of the list an abstract data type (adtis data storage class considered without reference to its implementation stacks and queues are adts they can be implemented using either arrays or linked lists in sorted linked listthe links are arranged in order of ascending (or sometimes descendingkey value insertion in sorted list takes (ntime because the correct insertion point must be found deletion of the smallest link takes ( time in doubly linked listeach link contains reference to the previous link as well as the next link doubly linked list permits backward traversal and deletion from the end of the list an iterator is referenceencapsulated in class objectthat points to link in an associated list iterator methods allow the user to move the iterator along the list and access the link currently pointed to an iterator can be used to traverse through listperforming some operation on selected links (or all linksquestions these questions are intended as self-test for readers answers may be found in appendix