Collection (abstract Data Type) - Linear Collections

Linear Collections

Many collections behave as if they are storing data in a line, ordered in some way, with access to one or both ends. The actual data structure implementing such a collection need not be linear – for example, a priority queue is often implemented as a heap, which is a kind of tree. Important such collections include:

• List
• Array
• Stack (FILO, LIFO)
• Queue (FIFO, LILO)
• Priority queue (often implemented as a heap)
• Double-ended queue (deque)
• Double-ended priority queue (DEPQ)