1. Implement the ADT queue by using an ADT deque to contain its entries.
2. Implement the ADT stack by using an ADT deque to contain its entries.
3. Describe an implementation of a queue that uses two stacks, and comment on its efficiency.
4. Implement the ADT deque by using a vector to contain its entries.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here