These linked lists are made up of a chain of nodes that are connected to each other in a linear fashion. The first node is called the head and has a pointer to the next node in the list. This node has a pointer to the next node as well as a data field to store an object. This chaining continues until the last node in the list, often called the tail, who's next pointer points to null.
This code can also have other functions to manipulate data.