【LeetCode 110】Balanced Binary Tree (C++)

Problem:

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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

    3
   / \
  9  20
    /  \
   15   7

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

       1
      / \
     2   2
    / \
   3   3
  / \
 4   4

Return false.

Solution:

可以有两种方法，一是由顶向下，一是自底向上上，由顶向下方法在检测每个子节点的深度时计算有重复，浪费资源，所以这里实现自底向上。

/**
 * 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 {
public:
    int get_d(TreeNode* root){
        int l_d,r_d;
        l_d=r_d=0;
        if(root->left!=NULL){
            l_d=get_d(root->left);
            if(l_d!=-1)l_d+=1;
        }
        if(root->right!=NULL){
            r_d=get_d(root->right);
            if(r_d!=-1)r_d+=1;
        }
        if(abs(l_d-r_d)>1||l_d==-1||r_d==-1)return -1;
        else{
            if(l_d>r_d)return l_d;
            return r_d;
        }
    }
    
    bool isBalanced(TreeNode* root) {
        if(root==NULL)return true;
        return get_d(root)!=-1;
    }
};

Attention:

平衡树的定义时任意结点的左右两棵子树高度相差不超过1，而不是任意结点的深度相差不超过1