How can you implement a connection between a hundred elements of a doubly linked list?

A doubly linked list consists of nodes, each containing data and two pointers: one to the next element and one to the previous element. To link a hundred elements, you need to create 100 nodes and set the pointers for each node so that they point to the neighboring elements.

Example of a node structure in C++:

struct Node {
    int data;
    Node* prev;
    Node* next;
};

Example of creating and linking 100 elements:

Node* head = nullptr;
Node* tail = nullptr;

for (int i = 0; i < 100; ++i) {
    Node* newNode = new Node{i, nullptr, nullptr};
    if (!head) {
        head = newNode;
        tail = newNode;
    } else {
        tail->next = newNode;
        newNode->prev = tail;
        tail = newNode;
    }
}

Thus, each element is linked to the previous and next, forming a doubly linked list of 100 elements.