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:
“For the most part, we are not where we are, but in a false position. Through an infirmity of our natures, we suppose a case, and put ourselves into it, and hence are in two cases at the same time, and it is doubly difficult to get out.”
—Henry David Thoreau (1817–1862)
“Whatever else may divide us, Europe is our common home; a common fate has linked us through the centuries, and it continues to link us today.”
—Leonid Brezhnev (1906–1982)
“The advice of their elders to young men is very apt to be as unreal as a list of the hundred best books.”
—Oliver Wendell Holmes, Jr. (1841–1935)