height

private int treeHeight(Node node){
    int x, y;
    if (node != null){
        x = treeHeight(node.left);
        y = treeHeight(node.right);

        return (x > y) ?  x + 1 : y + 1;
    }
    return 0;
}