This folder contains code for a working linked list that stores integers
(IntList.java) along with a driver that demonstrates that the code works.

The goal is to modify the linked list code to make it generic. Then
demonstrate that it works with Integer objects, Student objects (see
Student.java) and SugarGlider object (see SugarGlider.java). The
Student object implements the Comparable interface, the SugarGlider
does not but will need to be modified to provide one.

Steps:

1) Copy IntList.java to MyList.java (which we will use in the steps below).
   Also copy IntNode.java to MyNode.java and replace references in MyList.java
   of IntNode to MyNode. Update the driver and compile and test the new classes.
2) Parameterize the type and replace "int" with the type where appropriate. There
   are a lot of steps here:
   a) Replace MyList with MyList<T> (everywhere)
   b) Replace MyNode with MyNode<T> (everywhere)
   c) In MyList header identify that T extends Comparable<T>
   d) Replace all >,>=,<,<=,==,!= with calls to compareTo
   e) In driver when creating a list, specify MyList<Integer> (everywhere)
	When you finish with all of these compile and test.
3) In the driver get code to work for Student objects as well. This would probably
   be a good time to modify the return type of the search method from being a node
   to being of the parameterized type. If the search element is not found be sure
   to return null, else the value ... which will require adding an "if" to the
   method.
4) Add code to the driver to try to use SugarGlider objects. It should not
   compile.
5) Add a .compareTo method for the SugarGlider class to make allow it to
   be used in MyList. If you are using .equals in MyList you'll need to override
   .equals and .hashCode in SugarGlider.
6) Declare victory.