If your scheduled time is 12:40, 1:00, 1:20 or 1:40 your team needs to pick an alternative time for THIS WEEK ONLY.  You may choose from any of the following.  Send email to Dr. DeKock to select your alternate time.
8:20
8:40
9:40
10:00
10:20
6:20
6:40
7:00
7:20

Emphasis: Doubly Linked List, Dynamic Memory Handling

Program Requirements:

• This linked list will be a modified version of your previous list(Bag). There are a 4 major additions.
1. The node will contain a pointer to not only the next node, but also the previous node.
2. Instead of an integer, the node will have a character pointer. When you add a new node the character pointer will need to point to a new[ly] allocated character array.
3. In your list class you will have a pointer to the head of the list, and a separate pointer to the tail of the list.
4. You Node class must have a destructor ~Node().  This destructor function must delete[] the array of characters that represent a name.
• Maintain the same functionality that you had with the linked list in the previous assignment.
• Make sure that every time you call a function you meet the preconditions for that function!
• Make sure you have preconditions, post conditions and a one-line description of your program with every function prototype. (in the header file!)
• Make sure you comment variables which are not self explanatory.
• Make sure you comment logical blocks of code.
• Don't comment every line of your code.
• Make sure you follow the departmental programming guidelines and the programming requirements for this course.

Click here to read the departmental programming guidelines.
Click here to read programming requirements specific to this class.