 A simple extension to random access lists is the min-list, which provides an additional operation that yields the minimum element in the entire list in constant time (without mutation complexities).Both stacks and 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.