LeetCode-Solutions/solutions/110/110-gusrb3164.cpp at main · all1m-algorithm-study/LeetCode-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution
{
public:
    bool isBalanced(TreeNode *root)
    {
        if (dfs(root) == -1)
            return false;
        return true;
    }
    int dfs(TreeNode *node)
    {
        if (node == nullptr)
        {
            return 0;
        }
        int leftDepth = dfs(node->left);
        int rightDepth = dfs(node->right);
        if (leftDepth == -1 || rightDepth == -1 || abs(leftDepth - rightDepth) > 1)
        {
            return -1;
        }
        else
        {
            return max(leftDepth, rightDepth) + 1;
        }
    }
};