 This scheme, handy for creating simple caches, ensures that the most recently used items are also the quickest to find again.Another common approach is to "index" a linked list using a more efficient external data structure.For example, one can build a red-black tree or hash table whose elements are references to the linked list nodes.