A doubly linked list is a linked collection of nodes in which each node stores, in addition to its data, references to both its successor and its predecessor, whereas the default singly linked list stores only a successor reference. This second link makes the list bidirectionally traversable and lets a single pointer reach the current, next, and previous nodes, which reduces operations such as deletion from requiring two pointers to requiring one; the cost is additional memory per node for the extra reference and a greater number of links to reset correctly on every insertion or deletion, raising the risk of pointer errors. This belongs to the data structures subfield of computer science, as a variant of the linked list within the family of pointer-based linear collections.
A doubly linked list is a linked collection of nodes in which each node stores, in addition to its data, references to both its successor and its predecessor, whereas the default singly linked list s…