version which implements the min and max methods recursively, however they are specific to this particular tree's sorting algorithm, so not re-usable
Will try to implement a different version with re-usable methods
Basic implementation of a binary integer tree, containing min, max, contains, toString, add, depth
a better version of the depth method, which does not require the passing of an argument