An Abstract Queue (Queue ADT) is an abstract data type that emphasizes specific operations: Uses a explicit linear ordering, insertions and removals are performed individually, there are no restrictions on objects inserted into (pushed onto) the queue - that object is designated the back of the queue, . This topic discusses the concept of a queue: Description of an Abstract Queue, list applications, implementation, queuing theory, standard template library. | Lecture Algorithms and data structures Chapter 12 - Prefix Infix Postfix
