Doubly linked list
id:
doubly-linked-list-315-15755362
title:
Doubly linked list
text:
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 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 conceptualize
brand slug:
wiki
category slug:
encyclopedia
description:
Linked list data structure
original url:
https://en.wikipedia.org/wiki/Doubly_linked_list
date created:
date modified:
2022-11-03T03:43:14Z
main entity:
{"identifier":"Q5300179","url":"https://www.wikidata.org/entity/Q5300179"}
image:
fields total:
13
integrity:
14