Linked Lists

A linked list stores a sequence of elements as separate nodes, where each node contains a value and a pointer to the next node, rather than storing elements contiguously like an array. This makes inserting or removing elements in the middle of the list efficient, since it only requires updating a few pointers, but accessing an arbitrary element requires walking the list from the start. Variants include singly linked lists, doubly linked lists with pointers in both directions, and circular linked lists.