leetcode-简单题-110. 平衡二叉树

https://leetcode-cn.com/problems/balanced-binary-tree/submissions/

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
 //要想知道其平不平衡，那就根据题意，造一个递归的高度函数
 //高度函数getHeight()
 //传入参数：root
 //终止条件：if(root == null) return 0;
 //内部逻辑：
 // -1:不平衡 其他数：节点的高度
 //左子树高度，右子树高度，如果两个子树相差1，返回不平衡
class Solution {
    public boolean isBalanced(TreeNode root) {
        System.out.println(getHeight(root));
        return getHeight(root) == -1 ? false : true;
    }
    public int getHeight(TreeNode root){
        if(root == null) return 0;
        int leftHeight = getHeight(root.left);
        if(leftHeight == -1) return -1;//这两个是自己理解的时候没想到的，发现子树是不平衡的就马上返回了，不需要等待后面的左右比较
        int rightHeight = getHeight(root.right);
        if(rightHeight == -1) return -1;//这两个是自己理解的时候没想到的
        if(Math.abs(leftHeight - rightHeight) > 1) return -1; //不平衡返回-1
        return 1 + Math.max(leftHeight, rightHeight);
    }
}