public boolean contains(int n) {
   if (n == this.value) {
     return true;
   } else if (n > this.value) {
     if (right == null) {
       return false;
     } else {
       return right.contains(n);
     }
   } else {
     if (left == null) {
       return false;
     } else {
       return left.contains(n);
     }
   }
 }
 public boolean contains(int n) {
   return firstNode.contains(n);
 }