C++ Tutorial: The deque Class

This video demonstrates how to use the deque class form the C++ standard library. The deque class represents a double-ended queue.
The video shows t is shown
* how to add an element to the beginning of the deque using the push_front function
* how to add an element to the end of the deque using the push_back function
* how to remove an element from the front of a deque using the pop_front function
* how to remove an element from the back of a deque using the pop_back function
* how to get the first element at the beginning/end of a deque using the front()/back() function respectively

The deque class implements the circular array ADT. Watch the following video to learn what a circular array aka ring buffer: