doubly linked list

(data structure)

Definition: A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time.

Also known as two-way linked list, symmetrically linked list.

See also jump list.

Note: See [Stand98, p. 91].

Author: PEB

Implementation

Maksim Goleta's Collections (C#) implementing singly- and doubly-linked lists, binary search trees, and AVL trees.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 18 August 2008.
HTML page formatted Mon Aug 25 09:01:40 2008.

Cite this as:
Paul E. Black, "doubly linked list", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 18 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/doublyLinkedList.html