* {{cite book|author=[[Donald Knuth]]. ''|title=The Art of Computer Programming'', |location=Volume 1: |publisher=''Fundamental Algorithms'', Third Edition. Addison-Wesley. |year=1997. ISBN |isbn=978-0-201-89683-1.|pages=}} Section 2.2.1: Stacks, Queues, and Deques,. pp. 238-243.
* {{cite book|author=[[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''|title=[[Introduction to Algorithms]]'', |location=|publisher=Second Edition. MIT Press and McGraw-Hill. |year=2001. ISBN |isbn=978-0-262-03293-3.|pages=}} Section 10.1: Stacks and queues,. pp. 200-204.
* {{cite book|author=[[William Ford]], [[William Topp]]. ''|title=Data Structures with C++ and STL'', |location=|publisher=Second Edition. Prentice Hall. |year=2002. ISBN |isbn=978-0-13-085850-4.|pages=}} Chapter 8: Queues and Priority Queues,. pp. 386-390.
* {{cite book|author=[[Adam Drozdek]]. ''|title=Data Structures and Algorithms in C++'', |location=|publisher=Third Edition. Thomson Course Technology. |year=2005. ISBN |isbn=978-0-534-49182-6.|pages=}} Chapter 4: Stacks and Queues,. pp. 137-169.
