如何在java中获取avl树的高度

Question

i tried this function

private int height(AVLNode t )
{
    return t == null ? -1 : t.height;
}

i don't know what that method do can anyone explain it ?

Answer 1

The default approach is to use recursion to determine the height.

private int height(AVLNode t) {
    return t == null ? -1 : 1 + Math.max(height(t.left), height(t.right));
}

Answer 2

It returns the height of the AVLNode. If the AVLNode is null it returns -1. If the AVLNode is not null it returns the height of the AVLNode.

Answer 3

The method returns height of the AVLNode , -1 otherwise. The line return t == null ? -1 : t.height return t == null ? -1 : t.height is a ternary operator

Is equivalent to

if (t == null) {
    return -1
} else {
    return t.height
}

Answer 4

private int height(AVLNode t) {

        if (t == null) {
            return 0;
        }

        return 1 + Math.max((t.getLeft() != null ? t.getLeft().getHeight() : -1),
                (t.getRight() != null ? t.getRight().getHeight() : -1));

}