Editing Linked list (section)

===Random-access lists===
A [[random access list|random-access list]] is a list with support for fast random access to read or modify any element in the list.<ref name="okasaki">{{cite book |last=Okasaki |first=Chris |date=1995 |title=Purely Functional Random-Access Lists |work=In Functional Programming Languages and Computer Architecture |publisher=ACM Press |pages=86–95 |url=http://cs.oberlin.edu/~jwalker/refs/fpca95.ps |format=PS |access-date=May 7, 2015}}</ref> One possible implementation is a [[skew binary random access list|skew binary random-access list]] using the [[skew binary number system]], which involves a list of trees with special properties; this allows worst-case constant time head/cons operations, and worst-case logarithmic time random access to an element by index.<ref name="okasaki"/> Random-access lists can be implemented as [[persistent data structure]]s.<ref name="okasaki"/>

Random-access lists can be viewed as immutable linked lists in that they likewise support the same O(1) head and tail operations.<ref name="okasaki"/>

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{{clarify|r=should be "disregarding"?|date=October 2011}} mutation complexities).<ref name="okasaki"/>