 One possible implementation is a 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.Random access lists can be implemented as persistent data structures.Random access lists can be viewed as immutable linked lists in that they likewise support the same O(1) head and tail operations.