LeetCode题解之Balanced Binary Tree

1、题目描述

2、问题分析

DFS。

 

3、代码

  bool isBalanced(TreeNode* root) {
        if (root == NULL)
            return true;
        
        return  abs(height(root->left) - height(root->right)) <= 1 && isBalanced(root->left) && isBalanced(root->right); 
        
    }
    
    int height(TreeNode *node)
    {
        if (node == NULL)
            return 0;
        if (node->left == NULL && node->right == NULL)
            return 1;
        
        return 1 + max(height(node->left), height(node->right));
        
    }