the following algorithms for the doubly linked list are exactly the same as those listed previously for the singly linked list searching (defined in ss traversal (defined in ssinsertion the only major difference between the algorithm in ss is that we need to remember to bind the previous pointer of to the previous tail node if was not the first node to be inserted into the list algorithm add(value prevalue is the value to add to the list postvalue has been placed at the tail of the list node(value if head head tail else previous tail tail next tail end if end add figure shows the doubly linked list after adding the sequence of integers defined in ss figure doubly linked list populated with integers deletion as you may of guessed the cases that we use for deletion in doubly linked list are exactly the same as those defined in ss like insertion we have the added task of binding an additional reference ( reviousto the correct value