#ifndef LIST_H
#define LIST_H

using namespace std;

// The Node Class is correct, Fix the List Class
// The node used in List
template < class Item >
class Node
{
  public:
   Node(Item data);

   Item m_data; //when talking about the data type don't use <>
   Node<Item> * next;
};

// List is a linked list of ints
template < class Item >
class List
{
  public:
   // Creates a default empty list
   List();
   
   // Creates a copy of another list
   List(const List &rhs);
   
   // Destructor
   ~List();

   // Assignment operator
   const List& operator=(const List &rhs);

   // Insert "data" into the list
   void insert(/* TYPE GOES HERE */  data);
   
   // Remove "data" from the list.
   // Returns true on success, false on failure
   bool remove(/* TYPE GOES HERE */  data);

	// Prints the list
   void Print() const;
   
   // Prints the list in reverse order
   void ReversePrint() const;

   // Deletes all the elements in the list
   void clear();

   // Returns the size of the list
   unsigned int size() const;

  private:

   Node * m_head;

};

//Some thing Important goes here, make sure to add it

#endif