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).
-
Updated
Jan 21, 2019 - 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).
Add a description, image, and links to the enque topic page so that developers can more easily learn about it.
To associate your repository with the enque topic, visit your repo's landing page and select "manage topics."