: Data structs
: 2018-11-01 18:16:45
Description: deque, a double-ended queue
A "deque" is a data structure consisting of a list of items, on which the following operations are possible:
* Push(X, D): Insert item X on the front end of deque D.
* Pop(D): Remove the front item from deque D and return it.
* Inject(X, D): Insert item X on the rear end of deque D.
* Eject(D): Remove the rear item from deque D and return it. Write routines to support the deque that takes O(1) time per operation.
6-1 Deque.cpp, 3263 , 2018-10-16
__MACOSX, 0 , 2018-11-01
__MACOSX\._6-1 Deque.cpp, 172 , 2018-10-16