Repository for Data Structures and Algorithms in Python.
-
Updated
May 26, 2022 - Python
Repository for Data Structures and Algorithms in Python.
In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).
Basic algorithm and Datastructres
Add a description, image, and links to the double-ended-queue topic page so that developers can more easily learn about it.
To associate your repository with the double-ended-queue topic, visit your repo's landing page and select "manage topics."