Editing Linked list (section)

==Related data structures==
Both [[stack (data structure)|stacks]] and [[queue (data structure)|queues]] are often implemented using linked lists, and simply restrict the type of operations which are supported.

The [[skip list]] is a linked list augmented with layers of pointers for quickly jumping over large numbers of elements, and then descending to the next layer. This process continues down to the bottom layer, which is the actual list.

A [[binary tree]] can be seen as a type of linked list where the elements are themselves linked lists of the same nature. The result is that each node may include a reference to the first node of one or two other linked lists, which, together with their contents, form the subtrees below that node.

An [[unrolled linked list]] is a linked list in which each node contains an array of data values. This leads to improved [[CPU cache|cache]] performance, since more list elements are contiguous in memory, and reduced memory overhead, because less metadata needs to be stored for each element of the list.

A [[hash table]] may use linked lists to store the chains of items that hash to the same position in the hash table.

A [[heap (data structure)|heap]] shares some of the ordering properties of a linked list, but is almost always implemented using an array. Instead of references from node to node, the next and previous data indexes are calculated using the current data's index.

A [[self-organizing list]] rearranges its nodes based on some heuristic which reduces search times for data retrieval by keeping commonly accessed nodes at the head of the list.