Devise an implementation of a deque using a circularly linked list . A circularly linked list is a chain of nodes in which the last node points back to the fi rst. See Programming Exercise 19....

Devise an implementation of a deque using a circularly linked list . A circularly linked list is a chain of nodes in which the last node points back to the fi rst. See Programming Exercise 19. Determine those deque methods that take constant time and those that take time dependent on the number of elements in the deque. You do not need to compile the code, as this implementation does not meet our criterion of efficiency.