Recursive data structures (like linked lists) are often amenable to recursive definitions of some of the methods that operate on them.  In class, we wrote the contains method iteratively (using a IntNode reference and a while loop).

Write a recursive method called recursiveContains that takes an int as a parameter and returns true/false if the int is in the list.

Hint: to do this, you'll need to write a helper method that takes the value AND the current node you're at.  This will be the method that actually is recursive.  For example, something like:

private boolean containsHelper(IntNode current, int value)