How Linked Lists Work
A linked list is a data structure that chains together nodes, each holding a value and a pointer to the next node. Inserting a node just means relinking the pointers on the nodes before and after it — no other nodes need to move. That's the key difference from an array, which requires shifting elements.
Inserting a new node in the middle of a linked list, how many nodes need to move?