LeetCode110：平衡二叉树

简单思路，从根节点递归判断，时间复杂度：O($n^2$)

class Solution {
    public boolean isBalanced(TreeNode node){
        if (node == null){
            return true;
        }
        int leftH = getHeight(node.left);
        int rightH = getHeight(node.right);
        return isBalanced(node.left) && isBalanced(node.right) 
        	   && heightBalance(leftH, rightH);
    }

    public boolean heightBalance(int l,int r){
        return l == r || l - r == -1 || l - r == 1;
    }

    public int getHeight(TreeNode node){
        if (node == null){
            return 0;
        }
        return Math.max(getHeight(node.left), getHeight(node.right)) + 1;
    }
}

优化解，时间复杂度：O(n)。思路：对于当前遍历到的节点，先递归地判断其左右子树是否平衡，再判断以当前节点为根的子树是否平衡。如果一棵子树是平衡的，则返回其高度（高度一定是非负整数），否则返回 -1。如果存在一棵子树不平衡，则整个二叉树一定不平衡。

class Solution {
    public boolean isBalanced(TreeNode root) {
        return height(root) >= 0;
    }

    public int height(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int leftHeight = height(root.left);
        int rightHeight = height(root.right);
        if (leftHeight == -1 || rightHeight == -1 || Math.abs(leftHeight - rightHeight) > 1) {
            return -1;
        } else {
            return Math.max(leftHeight, rightHeight) + 1;
        }
    }
}

二叉树节点

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;
    }
}