力扣110. 平衡二叉树

给定一个二叉树，判断它是否是 

平衡二叉树

  

示例 1：

输入：root = [3,9,20,null,null,15,7]
输出：true

示例 2：

输入：root = [1,2,2,3,3,null,null,4,4]
输出：false

示例 3：

输入：root = []
输出：true

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {boolean}
 */
var isBalanced = function (root) {
    function getHight(root) {
        if (!root) {
            return 0
        }
        let left = getHight(root.left)
        if(left==-1) return -1
        let right = getHight(root.right)
        if (right==-1||Math.abs(left - right) > 1) return -1
        return Math.max(left, right) + 1
    }
    return getHight(root) != -1 ? true : false


};