public int min()
{
int lowest = number;
if (left != null)
{
lowest = left.min();
}
return(lowest);
}
/**
* Returns the smallest value in the tree (or -1 if tree is empty)
*/
public int min()
{
return(root.min());
}
