<P> An unrolled linked list is a linked list in which each node contains an array of data values . This leads to improved 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 . </P> <P> A hash table may use linked lists to store the chains of items that hash to the same position in the hash table . </P> <P> A 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 . </P> <P> 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 . </P>

Advantages of linked list over array in data structure