Doubly linked list
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 three fields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field. 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.
Wikipage disambiguates
Wikipage redirect
Architecture of BtrieveAssociative arrayBest, worst and average caseBrain Fuck SchedulerC++ Standard LibraryDLLDancing LinksDirectory-based cache coherenceDouble-ended queueDouble compare-and-swapDouble linked listDoubly-linked listDoubly connected edge listEulerian pathExact coverExclusive orExecutable UMLFibonacci heapJava collections frameworkKnuth's Algorithm XList of data structuresList of terms relating to algorithms and data structuresLoader (computing)Mnemonic link systemMultics EmacsPartition refinementQueapQueue (abstract data type)Real-time operating systemRun queueSLIP (programming language)Sequence container (C++)Skip graphStandard Template LibraryUnrolled linked listWeak orderingX-fast trieXOR linked list
Link from a Wikipage to another Wikipage
primaryTopic
Doubly linked list
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 three fields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field. 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.
has abstract
Em ciência da computação, uma ...... r complexidade nos algoritmos.
@pt
En ciencias de la computación, ...... nsertar es lo único necesario.
@es
In computer science, a doubly ...... that its link can be modified.
@en
Двобічно зв'язаний список — ви ...... мований на змінюваний елемент.
@uk
双向链表,又稱為双链表,是链表的一种,它的每个数据结点中都有 ...... 便地访问它的前驱结点和后继结点。一般我们都构造双向循环链表。
@zh
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,016,985,194
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
Em ciência da computação, uma ...... s mesmos itens de dados, mas e
@pt
En ciencias de la computación, ...... r a través del nodo centinela.
@es
In computer science, a doubly ...... in opposite sequential orders.
@en
Двобічно зв'язаний список — ви ...... писку вказує на голову списку.
@uk
双向链表,又稱為双链表,是链表的一种,它的每个数据结点中都有 ...... 便地访问它的前驱结点和后继结点。一般我们都构造双向循环链表。
@zh
label
Doppelt verkettete Liste
@de
Doubly linked list
@en
Lista doblemente enlazada
@es
Lista duplamente ligada
@pt
Двобічно зв'язаний список
@uk
双向链表
@zh