Homework 2: Double Ended Queue

Write a program that implements a double ended queue. Use the ideas found in exercises 9-10, p.95 of the text.

The program should have printout showing that each operation on the queue has been tested.

Also take string data stored as a char* and push it onto the queue. Then have one routine that pops the queue and prints the string in reverse(LIFO order) and a second routine that prints the contents in FIFO order.

Use the deque to write a routine that tests if a string is a palindrone. Do this by popping each end as long as the strings match.

Use assertions to guarantee correctness where desirable.