public class SearchTree {

    private boolean empty = false;
    private int root;
    private SearchTree left;
    private SearchTree right;

    public SearchTree() {
        empty = true;
    }

    public SearchTree(int rt, SearchTree l, SearchTree r) {
        root = rt;
        left = l;
        right = r;
    }

    public boolean search(int n) {
        if(empty) {
            return false;
        } else if(root == n) {
            return true;
        } else if(root > n) {
            return left.search(n);
        } else {
            return right.search(n);
        }
    }

    public SearchTree insert(int n) {
        if(empty) {
            return new SearchTree(n, new SearchTree(), new SearchTree());
        } else if(

}