The deque is implemented as a doubly-linked list and this makes it fast, i.e. O(1) or constant time, to work at the right and left ends as there are pointers to each end. Away from the ends accessing ...