gistfile1.java

public class BinaryTree {
 
    private Node root;
   
    public boolean search(int value) {
        return root != null && root.search(value);
    }
}

public class Node {

    private int value;

    public boolean search(int value) {
        if (this.value == value) {
            return true;
        } else if (value > this.value) {
            return right != null && right.search(value);
        } else {
            return left != null && left.search(value);
        }
    }
}