Linked lists

data structure which is a linear collection of data elements, called nodes, each pointing to the next node by means of a pointer

data structure that allows fast search within an ordered sequence of elements

basic unit of a graph data structure such as a tree or linked list

linked list in which each node references both its successor and its predecessor

variant of the doubly linked list data structure used in computer programming

data structure which consists of a set of data records (nodes) linked together and organized by references (links or pointers)

a technique for reverting a deleted node from a circular doubly linked list

data structure used in a scheme for dynamic memory allocation

variation on the linked list data structure which stores multiple elements in each node

list that reorders its elements based on some self-organizing heuristic to improve average access time