Python’s deque: Implement Efficient Queues and Stacks
If you often work with lists in Python, then you probably know that they don’t perform fast enough when you need to pop and append items on their left end. Python’s collections module provides a class called deque that’s specially designed to provide fast and memory-efficient ways to append and pop item from both ends of the underlying data structure.
Python’s deque is a low-level and highly optimized double-ended queue that’s useful for implementing elegant, efficient, and Pythonic queues and stacks, which are the most common list-like data types in computing.
In this tutorial, you’ll learn:
- How to create and use Python’s
dequein your code - How to efficiently append and pop items from both ends