Editing Unrolled linked list (section)

{{Short description|Computer programming data structure}}
{{One source|date=March 2021}}
[[File:Unrolled linked lists (1-8).PNG|thumb|180px|In this model, the maximum number of elements is 4 for each node.]]

In computer programming, an '''unrolled linked list''' is a variation on the [[linked list]] which stores multiple elements in each node. It can dramatically increase [[CPU cache|cache]] performance, while  decreasing the memory overhead associated with storing list metadata such as [[reference]]s. It is related to the [[B-tree]].