A deque (''double-ended queue'') is a sequence in which items can be inserted and deleted at either the front or the rear. Operations on deques are the constructor
Show how to represent deques using pairs, and give implementations of the operations. All operations should be accomplished in Θ(1) steps.
Nobody's finished this exercise yet. You'll be the first!
There are no comments yet.
You must log in to post a comment.Login