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.

Hide Tags

Tree Depth-first Search

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int depth(TreeNode *node){
        if(node==NULL)
            return ;
        int i=depth(node->left);
        int j=depth(node->right);
        return max(i,j)+;
    }
    bool isBalanced(TreeNode *root) {
        if(root==NULL)
            return true;
        int leftDep=depth(root->left);
        int rightDep=depth(root->right);
        if(abs(leftDep-rightDep)<=)
            return isBalanced(root->left) && isBalanced(root->right);
        else
            return false;
    }
};