title: Java recursive binary tree
body: <p>Welcome!
  I have a recursive public static method named less that takes a tree node (an original binary tree, not really a search tree) and a int parameter that returns if all the values in the tree are less than the integer. So, I would use a <code>public class TN { public int value;     public TN left, right;   public TN(int v, TN l, TN r) {value = v; left = l; right = r;} }</code>
  So, my method would look like this:</p>
  
  <pre><code>public static boolean less(TN s, int toFind){
  if (s == null)
     return true;
  else{ 
   if(s.value &lt;= toFind)  
     return less(s.left, toFind) &amp;&amp; less(s.right, toFind);  // right here do I return true? or do I have to somehow recall recursively
   else  
     return false; 
  }
  </code></pre>
  
  <p>I was wondering if that was right or am I missing something??? Do I have to return true and false??</p>