Leetcode/leetcode110.cpp at main · ksaini-web/Leetcode · 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
39
40
41
/**
 * 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:

int solve(TreeNode* root){

    if(root == NULL){
        return 0;
    }

    int left = solve(root->left);

    if(left == -1) return -1;

    int right = solve(root->right);

    if(right == -1) return -1;

    if(abs(left-right)>1){
        return -1;
    }

    return 1+max(left,right);


}
    bool isBalanced(TreeNode* root) {

        return solve(root)!=-1;
    }
};