On Friday, Feb 12, we will discuss an implementation of the Queue data
structure using doubly linked lists. The third homework is to provide
the code corresponding to this implementation for the
outlined MyQueue class .
You may find it useful to study
our stack implementation using singly
linked lists, and to look at the overview of linked lists in Section 3.2
Note added Feb 19: Just in case you are still wondering, the Queue ADT is
described in Section 3.7 along with an implementation using an array.
We want an implementation using a doubly linked list that we will create.