A pile is an abstract data structure that combines the properties of the deque and a priority queue and may be described as an ordered dequeue.
A pile is an abstract data structure. This abstract data structure combines the properties of the deque. This abstract data structure combines the properties of a priority queue. This abstract data structure may be described as an ordered dequeue.