LeetCode 110: Balanced Binary Tree

Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

解题思路

高度（height）平衡的二叉树要么是空树要么具有下列性质的二叉树：

• 左子树和右子树的高度之差的绝对值不超过 1
• 左子树和右子树都是高度平衡的

思路一：写一个 getHeight() 函数用于返回一棵树的高度。判断一棵树是否是高度平衡的二叉树时，先调用 getHeight() 函数返回左、右子树的高度并判断高度之差的绝对值是否不超过1，然后递归判断左、右子树是否是平衡的。代码如下啊：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int height(TreeNode *root) {
        if (root == NULL) return 0;
        return 1 + max(height(root->left), height(root->right));
    }
public:
    bool isBalanced(TreeNode* root) {
        if (root == NULL) return true;

        int leftH = height(root->left);
        int rightH = height(root->right);

        return abs(leftH - rightH) <= 1 && 
               isBalanced(root->left) && 
               isBalanced(root->right);
    }
};

思路二：只需一次 DFS 遍历就可以了。

代码一：使用了一个引用型参数来返回当前结点的高度：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    bool isBalanced(TreeNode *root, int &height) {
        if (root == NULL) {
            height = 0;
            return true;
        }

        int leftH, rightH;
        bool leftBalanced = isBalanced(root->left, leftH);
        bool rightBalanced = isBalanced(root->right, rightH);

        height = 1 + max(leftH, rightH);
        return leftBalanced && rightBalanced && abs(leftH - rightH) <= 1;
    }
public:
    bool isBalanced(TreeNode* root) {
        int height = 0;
        return isBalanced(root, height);
    }
};

代码二：返回值小于 0 表示高度不平衡，否则表示当前子树的高度：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int height(TreeNode *root) {
        if (root == NULL) return 0;

        int leftH = height(root->left);
        int rightH = height(root->right);

        if (leftH == -1 || rightH == -1) return -1;

        if (abs(leftH - rightH) > 1) return -1;

        return 1 + max(leftH, rightH);
    }
public:
    bool isBalanced(TreeNode* root) {
        return height(root) >= 0;
    }
};