list (first-->last){ { { { found link with key deleted link with key list (first-->last){ { { the find(method the find(method works much like the displaylist(method seen in the last program the reference current initially points to firstand then steps its way along the links by setting itself repeatedly to current next at each linkfind(checks if that link' key is the one it' looking for if it isit returns with reference to that link if it reaches the end of the list without finding the desired linkit returns null the delete(method the delete(method is similar to find(in the way it searches for the link to be deleted howeverit needs to maintain reference not only to the current link (current)but to the link preceding the current link (previousthis is becauseif it deletes the current linkit must connect the preceding link to the following linkas shown in figure the only way to tell where the preceding link isis to maintain reference to it at each cycle through the while loopjust before current is set to current nextprevious is set to current this keeps it pointing at the link preceding current to delete the current link once it' foundthe next field of the previous link is set to the next link special case arises if the current link is the first link because the first link is pointed to by the linklist' first field and not by another link in this case the link is deleted by changing first to point to first nextas we saw in the last program with the deletefirst(method here' the code that covers these two possibilities/found it if(current =firstfirst first next/if first link/change first else /otherwiseprevious next current next/bypass link other methods we've seen methods to insert and delete items at the start of list and to find specified item and delete specified item you can imagine other useful list methods for examplean insertafter(method could find link with specified key value and insert new link following it we'll see such method when we talk about list iterators at the end of this