Doubly linked list in the context of Reference (computer science)


Doubly linked list in the context of Reference (computer science)

Doubly linked list Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Doubly linked list in the context of "Reference (computer science)"


⭐ Core Definition: 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.

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.

↓ Menu
HINT:

In this Dossier

Doubly linked list in the context of Mnemonic link system

A mnemonic link system, sometimes also known as a chain method, is a method of remembering lists that is based on creating an association between the elements of that list. For example, when memorizing the list (dog, envelope, thirteen, yarn, window), one could create a story about a "dog stuck in an envelope, mailed to an unlucky thirteen black cat playing with yarn by the window". It is argued that the story would be easier to remember than the list itself.

Another method is to actually link each element of the list with a mental picture of an image that includes two elements in the list that are next to each other. This would form an open doubly linked list which could be traversed at will, backwards or forwards. For example, in the last list one could imagine their dog inside of a giant envelope, then a black cat eating an envelope. The same logic would be used with the rest of the items. The observation that absurd images are easier to remember is known as the Von Restorff effect, although the success of this effect was refuted by several studies (Hock et al. 1978; Einstein 1987), which found that the established connection between the two words is more important than the image's absurdity.

View the full Wikipedia page for Mnemonic link system
↑ Return to Menu