Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Figure 3.12: Insertion at the tail of a singly linked list:
(a) before the insertion; (b) creation of a new node; (c)
after the insertion. Note that we set the next link for
the tail in (b) before we assign the tail variable to
point to the new node in (c).
Code Fragment 3.15: Inserting a new node at the
end of a singly linked list. This method works also if
the list is empty. Note that we set the next pointer for
the old tail node before we make variable tail point to
the new node.
3.2.2 Removing an Element in a Singly Linked List
168