Dom Week 8 Data Structures

Modify the Queue class to create a Deque class. A deque is a queue-like structure that allows elements to be added and removed from both the front and the back of the list. Test your class in a program.

Use the Deque class you created in Example 5–1 to determine if a given word is a palindrome.

Modify the priority queue example from Example 5–5 so that the higher-priority elements have higher numbers rather than lower numbers. Test your implementation with the example in the chapter.