Here\'s what I have:
public class Node{ Object data; Node next; Node(Object data, Node next){ this.data = data; this.next = next
Start from the head:
Node currentNode = headNode; while (node.getNext() != null) { currentNode = currentNode.getNext(); } currentNode.setNext(newNodeForInsertion);
A faster way is to store the last node of the list somewhere so you don't have to go through the whole list.