val and next.get to traverse the list until the index.addAtHead by creating a new node and linking it to the current head.addAtTail by traversing to the end and linking the new node.addAtIndex by finding the node before the index and linking the new node.deleteAtIndex by linking the node before the index to the node after the index.