SettingsLinked lists
Association list
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value.
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value.
Dancing Links
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
Difference list
In computer science, the term difference list may refer to one of two data structures for representing lists.
In computer science, the term difference list may refer to one of two data structures for representing lists.
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.
In computer science, a doubly-linked list is a linked data structure that consists of a set of sequentially-linked records called nodes.
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.
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes.
Linked list
In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence.
In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence.
Node (computer science)
A node is a record used to build linked data structures such as trees, linked lists, and computer-based representations of graphs.
A node is a record used to build linked data structures such as trees, linked lists, and computer-based representations of graphs.
Self-organizing list
A self-organizing list is a list that reorders its elements based on some self-organizing heuristic to improve average access time.
A self-organizing list is a list that reorders its elements based on some self-organizing heuristic to improve average access time.
Sentinel node
A sentinel node is a specifically designated node used with linked lists and trees as a traversal path terminator.
A sentinel node is a specifically designated node used with linked lists and trees as a traversal path terminator.
Sentinel value
In computer programming, a sentinel value (also referred to as a flag value, trip value, rogue value, signal value, or dummy data) is a special value whose presence...
In computer programming, a sentinel value (also referred to as a flag value, trip value, rogue value, signal value, or dummy data) is a special value whose presence...
Skip list
A skip list is a data structure for storing a sorted list of items using a hierarchy of linked lists that connect increasingly sparse subsequences of the items.
A skip list is a data structure for storing a sorted list of items using a hierarchy of linked lists that connect increasingly sparse subsequences of the items.
Unrolled linked list
In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node.
In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node.
VList
In computer science, the VList is a persistent data structure designed by Phil Bagwell in 2002 that combines the fast indexing of arrays with the easy extension of cons-based linked lists.
In computer science, the VList is a persistent data structure designed by Phil Bagwell in 2002 that combines the fast indexing of arrays with the easy extension of cons-based linked lists.
XOR linked list
XOR linked lists are a data structure used in computer programming.
XOR linked lists are a data structure used in computer programming.