In this type of list, you cannot delete an arbitrary node without access to the node’s predecessor. Fortunately, Java ... in a doubly-linked list, which contains the link fields in the last ...