Refers to a non-destructive operation performed on sequential, collection-like data structures that have the notion of top element or next element, such as stacks, queues and streams. The `peek` operation returns the value of the top (or next) element without consuming that element, i.e. without removing that element from the data structure.
