An item may be added to the head of the list if the new item is valued less than or equal to the current head or to the tail of the list if the new item is greater than or equal to the current tail.
Piles of this kind are used in the "UnShuffle sort" sorting algorithm.