1) Write me a node method that counts the number of elements in a list.
  cout << head->count() << endl; // print "4", the number of items in the list

2) Write me a node method that returns the maximum of all the nodes in the list.
  cout  << head->max() << endl; // prints 12, the biggest element in the list

3) Write me a node method that returns a bool describing whether that value appears in the list.
  if (head->search(112))
    cout << "There is at least one 112 in the list\n";

4) Write me a node method that returns an int describing the number of times that value appears in the list.
  if (head->search(112) == 3)
    cout << "There are exactly 3  112s in the list\n";

5) Write me a node method that inserts a node at the end of the list.
   head->insertLast(112); // the list has a '112' stuck on the end

6) Write me a node method that deletes the node at the end of the list.
   head->deleteLast(); // the list's last node is gone