The Node class must be represented as a template.

The Node class will require these private fields.

• T data: The data to hold in the Node
• Node* next: A pointer to the next Node (if any) in the chain of Nodes.
• Node* prev: A pointer to the previous Node (if any) in the chain of Nodes.

Linked List

This class will require the following fields:

• Node* mHead: Points the first Node in the chain
• Node* mTail: Points the last Node in the chain
• int mSize: Keeps a count of the number of Nodes in the chain

Your LinkedList class must also support the following public member functions.

• LinkedList(): A default constructor sets both pointers to null and sets the size to 0.
• LinkedList(const LinkedList&): A copy constructor that takes a LinkedList object and performs a deep copy of the passed list into this list.
• ~LinkedList(): A destructor that performs pop_front on the list while the list is not empty.
• operator=(const LinkedList&): LinkedList& An overloaded assignment operator that deletes the current array and replaces it with deep copy of the passed list.
• size() const: int: Returns the size of the LinkedList.
• push_back(const T): void: Creates a new Node and assigns it to the end of the list of Nodes while updating the size by 1.
• push_front(const T): void: Creates a new Node and assigns it to the front of the list of Nodes while updating the size by 1.
• pop_back(): T: Deletes the Node at the end of the list (or throws an error if this is not possible). Decreases size by 1. Returns the deleted element.
• pop_front(): T: Deletes the Node at the front of the list (or throws an error if this is not possible). Decreases size by 1. Returns the deleted element.
• at(int) const: T: Returns the element stored at the specified index. If the index is out-of-bounds (either for being negative or greater than/equal the size of the list), throw invalid\_argument("Index out of bounds.");. This will require you to include the stdexcept library. This method should operate at O(1) for accessing the first or last element in a list and at O(n) for any element other than the first or the last.
• front() const: T: Returns the first element.
• back() const: T: Returns the last element.

Return to the Books object.

Return to your Books code. Find Books.h and remove the import statements to vector.hpp and replace those with the local version of LinkedList.hpp that you made.

• Add a menu option to add to the beginning of the list.
• Add a menu option to remove the first Book in the list.
• Add a menu option to remove the last Book in the list.
• Add a menu option to remove every Book in the list.

Test your linked list application. Add a Book to the list 1,000 times. Add a second Book to the list 1,000 times. Remove the first Book in the list. Remove the last Book in the list. Verify that you have 1,998 Books in the list.

After you verify that there are 1,998 Books in the list, clear the list using your newest menu option. Verify that you have 0 Books in the list.

What to Hand In

Upload a zip file containing the following files to the drop box on D2L:

• LinkedList.hpp - the header file containing the entire class declaration and external definitions of the LinkedList class. Normally, the definitions would be in a separate file, but class templates need to be handled differently in order for them to be compiled properly by the C++ compiler.
• Node.hpp
• All files updated from the last homework assignment that have been updated to fit this new linked list.
• Make sure your name, CSCI 3250, and Programming Assignment 4 appear in comments in all of your files.
• Note: NO CREDIT will be given to programming assignments that do not compile.
• Make sure you have compiled and tested your program before handing it in.

Example

My Headers

#ifndef Node_HPP #define Node_HPP #include

template class Node { T data; Node* next; Node* prev; };

#ifndef LinkedList_HPP #define LinkedList_HPP #include template class LinkedList { private: Node* mHead; Node* mTail; int mSize; void clear(); void copy(const LinkedList& list); void checkForEmptyList(); public: LinkedList(); LinkedList(const LinkedList&); ~LinkedList(); LinkedList& operator=(const LinkedList&); int size() const; T at(int) const; T front() const; T back() const; void push_front(T); void push_back(T); T pop_front(); T pop_back(); };

You have to write the rest. I begging for some help