figure singly linked list node figure singly linked list populated with integers insertion in general when people talk about insertion with respect to linked lists of any form they implicitly refer to the adding of node to the tail of the list when you use an api like that of dsa and you see general purpose method that adds node to the listyou can assume that you are adding the node to the tail of the list not the head adding node to singly linked list has only two cases head in which case the node we are adding is now both the head and tail of the listor we simply need to append our node onto the end of the list updating the tail reference appropriately 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 tail next tail end if end add as an example of the previous algorithm consider adding the following sequence of integers to the list and the resulting list is that of figure searching searching linked list is straightforwardwe simply traverse the list checking the value we are looking for with the value of each node in the linked list the algorithm listed in this section is very similar to that used for traversal in ss