ADTs, Data Structures, and Problem Solving with C++ 2nd Edition by Larry Nyhoff

Exercise 1

Imitating the implementation of a queue using a circular array, construct an implementation of a deque. Select appropriate data members and write functions to implement the basic operations (constructor, check if the deque is empty, add at the front, add at the back, remove at the front, remove at the back, and an output operation).