In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links, respectively, point to some kind of terminator, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. It can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.
The two node links allow traversal of the list in either direction. While adding or removing a node in a doubly linked list requires changing more links than the same operations on a singly linked list, the operations are simpler and potentially more efficient (for nodes other than first nodes) because there is no need to keep track of the previous node during traversal or no need to traverse the list to find the previous node, so that its link can be modified.
Read more about Doubly Linked List: Nomenclature and Implementation
Famous quotes containing the words doubly, linked and/or list:
“A man calumniated is doubly injured—first by him who utters the calumny, and then by him who believes it.”
—Herodotus (c. 484–425 B.C.)
“The exercise of letters is sometimes linked to the ambition to contruct an absolute book, a book of books that includes the others like a Platonic archetype, an object whose virtues are not diminished by the passage of time.”
—Jorge Luis Borges (1899–1986)
“Thirty—the promise of a decade of loneliness, a thinning list of single men to know, a thinning brief-case of enthusiasm, thinning hair.”
—F. Scott Fitzgerald (1896–1940)