Each item in a linked list is treated as a separate entity by the data structure. When you create a linked list, the items are stored in multiple locations. The pointers connect the elements of a Linked List to one another. A list node contains two pieces of information: data and a pointer (also known as a pointer or reference or link) to the next node in the sequence. The final node is a reference to nothing. A linked list's "head" is the first node. It's important to remember that the head refers to the root rather than a specific node. Because the list contains no elements, the head is treated as a null reference in this case.