Every linked list node must contain a 'next' address field (pointer) that points to the subsequent node or null if it's the last node. Without this field, nodes couldn't be linked together to form a list. Nodes typically also have a data field, but the next pointer is the essential requirement.