A singly linked list stores a sequence in non-contiguous, dynamically allocated blocks called nodes, each holding a data field and a link field containing the address of its successor, with a null link marking the end of the list. Because node addresses are arbitrary and unrelated, the links are the only structural information; the list's entire identity is a single pointer to the head node, and a null head denotes an empty list. Insertion consists of allocating a node, populating its fields, and repairing the surrounding links, while traversal advances a temporary pointer along successive links — the head pointer itself must never be advanced, or the list becomes unreachable. This sits in the data-structures branch of computer science as the canonical pointer-based alternative to the contiguous array.
A singly linked list stores a sequence in non-contiguous, dynamically allocated blocks called nodes, each holding a data field and a link field containing the address of its successor, with a null li…