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).
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)