What happens inside a linked list when a new element is inserted exactly in its middle?

When inserting a new element into the middle of a linked list, the following steps occur:

1. A new node with the desired value is created.
2. The node after which the new node should be inserted is found (for example, the node with index n).
3. The new node gets a link to the next node after the found node (i.e., newNode.next = current.next).
4. The link of the current node is updated to point to the new node (current.next = newNode).

Thus, the new element is inserted between two existing nodes, and the chain of links is maintained.

Example in Java:

class Node {
    int value;
    Node next;
    Node(int val) { value = val; }
}

void insertAfter(Node current, int newValue) {
    Node newNode = new Node(newValue);
    newNode.next = current.next;
    current.next = newNode;
}