<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">class TreeSearch {
   
   public static void main(String[] args) {
      TreeNode&lt;Integer&gt; t1 = new TreeNode&lt;Integer&gt;(1, null, null);
      TreeNode&lt;Integer&gt; t13 = new TreeNode&lt;Integer&gt;(13, null, null);
      TreeNode&lt;Integer&gt; t29 = new TreeNode&lt;Integer&gt;(29, null, null);
      TreeNode&lt;Integer&gt; t48 = new TreeNode&lt;Integer&gt;(48, null, null);
      TreeNode&lt;Integer&gt; t91 = new TreeNode&lt;Integer&gt;(91, null, null);
      TreeNode&lt;Integer&gt; t20 = new TreeNode&lt;Integer&gt;(20, t13, null);
      TreeNode&lt;Integer&gt; t54 = new TreeNode&lt;Integer&gt;(54, t48, null);
      TreeNode&lt;Integer&gt; t80 = new TreeNode&lt;Integer&gt;(80, t54, t91);
      TreeNode&lt;Integer&gt; t6 = new TreeNode&lt;Integer&gt;(6, t1, t20);
      TreeNode&lt;Integer&gt; t47 = new TreeNode&lt;Integer&gt;(47, t29, t80);
      TreeNode&lt;Integer&gt; t25 = new TreeNode&lt;Integer&gt;(25, t6, t47);
      for (int i = 0; i &lt; 100; i++) {
         if (treeSearch(i,t25)) System.out.print(i + " ");
      }
      System.out.println();
   }
   
   static boolean treeSearch(Comparable x, TreeNode t) {
      if (t == null) return false;
      switch (x.compareTo(t.data)) {
         case 0: return true; //found
         case 1: return treeSearch(x, t.right);
         default: return treeSearch(x, t.left);
      }
   }
}

class TreeNode&lt;T extends Comparable&gt; {
   TreeNode&lt;T&gt; left = null;
   TreeNode&lt;T&gt; right = null;
   T data;
   
   TreeNode(T data, TreeNode&lt;T&gt; left, TreeNode&lt;T&gt; right) {
      this.data = data;
      this.left = left;
      this.right = right;
   }
}
   </pre></body></html>