Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Concept

Doubly Linked List

Data Structure

A linked list in which each node holds a reference to both its predecessor and its successor, allowing traversal in either direction and constant-time removal of a known node without walking the list from the head.

Facts
Core Principle
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. 1
Connections

In Field

Sources
1. doubly linked list, Dictionary of Algorithms and Data Structures, NIST
Definition
Quote, 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.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.