How to initialize a Queue in Python

A queue is a first-in-first-out (FIFO) data structure. For instance, consider a queue of passengers boarding the plane. The person who enters the queue last will be the last person to board the plane. Likewise, the person who was first will be the earliest to board the plane.

Queues can be implemented in Python in many ways. Below we highlight each of these methods.

Lists come by default in Python and we can use a list to mimic queues. Assume you have a queue of passengers: “Tom”, “Mary”, and “Liz”. Below is code to initialize the queue (as an empty list), adding passengers to the list using the “append” method and finally printing the passengers.

The output is:

As you can see the item inserted earliest appears first in the list and the item inserted last appears last.

Of course you can also initialize the queue directly with three passengers rather than one at a time. The code below accomplishes this:

with the same output as before.

The second approach to initialize and implement a queue in Python is to use the collections module and specifically the data structure called “deque” (double ended queue). A deque is more than what we need but it is optimized for fast insertions and removals. Here is the code to initialize a queue using the collections.deque data structure and add elements one by one.

The passengers data structure is initially set to be an empty deque. Then three elements are added one by one so that when we print it we get the output:

Again, like the Python list data structure you can initialize it with the three elements directly:

giving the same output as before.

The third approach to initialize a queue is to use the queue module and the Queue data structure within it. Here is the corresponding code and methods to accomplish the same example as above:

In the above program, the parameter 5 refers to the maximum size of the queue. Each put() command adds an element. The output is (your specific output might vary):

This output is not very informative. To confirm the contents of the queue have been added as intended, we can use the get() method:

The output will be:

The get() method removes elements from the queue in the order they are added. Following these get() methods, the queue will be empty.

There you have it - three different methods to initialize a queue. Which method is your favorite?

Interested in more things Python? Checkout our post on Python stacks. See our blogpost on Python's enumerate() capability. Also if you like Python+math content, see our blogpost on Magic Squares. Finally, master the Python print function!

Want to learn Python with us? Sign up for 1:1 or small group classes.

Method 1: Use a list data structure

Method 2: Use a collections.deque data structure

Method 3: Use a queue.Queue data structure