gistfile1.java

public class BinaryTree {

    public boolean search(int value) {
        return search(value, this.root);
    }

    private boolean search(int value, Node root) {

        if (root.getValue() == value) {
            return true;
        }

        if (value < root.getValue() && !root.isLeftEmpty()) {
            return search(value, root.getLeft());
        }
        if (value > root.getValue() && !root.isRightEmpty()) {
            return search(value, root.getRight());
        }
 
        return false;
    }

}