What is the main data structure used to implement a linked list?

The main data structure for implementing a linked list is the Node, which contains two fields:

• Data (the value of the list element)
• A reference (pointer) to the next node in the list

In the case of a doubly linked list, an additional reference to the previous node is added.

Example in Java for a singly linked list:

class Node {
    int data;
    Node next;

    Node(int data) {
        this.data = data;
        this.next = null;
    }
}