Miscellany

    public int balanced(Node n) {        if (n == null) {            return 0;        }        int lh = balanced(n.left);        int rh = balanced(n.right);        if (lh != -1 && rh != -1 && (Math.abs(lh - rh) <= 1)) {            return 1 + ((lh > rh) ? lh : rh);        } else {            return -1;        }    }    public boolean balanced() {        return balanced(root) != -1;    }