LEETCODE--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.

Subscribe to see which companies asked this question
方法一：

/**
 * 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:
    bool checkBalance(TreeNode *node, int &dep)
     {
         if (node == NULL)
         {
             dep = 0;
             return true;
         }
         int leftDep, rightDep;
         bool leftBalance = checkBalance(node->left, leftDep);
         bool rightBalance = checkBalance(node->right, rightDep);
         dep = max(leftDep, rightDep) + 1;
         int x = rightDep - leftDep;
         if(x < -1 || x > 1)
           return 0;
         else
           return leftBalance && rightBalance;
     }
     bool isBalanced(TreeNode *root) {
         int dep;
         return checkBalance(root, dep);
     }
};

方法二：

/**
 * 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 depth(TreeNode* root){
        if(!root)
          return 0;
        int ldepth,rdepth;
        if(root){
            ldepth = depth(root->left);
            rdepth = depth(root->right);
        }
        return ldepth > rdepth ? ldepth+1 : rdepth+1;
    }
    bool isBalanced(TreeNode* root) {
        int ldepth,rdepth;
        if(!root)
          return 1;
        bool lyn = isBalanced(root->left);
        bool ryn = isBalanced(root->right);
        ldepth = depth(root->left);
        rdepth = depth(root->right);
        int x = ldepth-rdepth;
        if(lyn && ryn){
            if(x < -1 || x > 1)
              return 0;
            else
              return 1;
        }
        else
          return 0;
    }
};