leetcode/0100: balancedBinaryTree.cpp at main · jmartinez159/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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/**
 * 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(root == nullptr){

            return true;
        }

        int check = height(root->left) - height(root->right);

        if(check<0){

            check*=-1;
        }

        if(check > 1){

            return false;
        }

        if(!isBalanced(root->left)){

            return false;
        }


        if(!isBalanced(root->right)){

            return false;
        }


        return true;

    }

    int height(TreeNode* root){

        if(root == nullptr){

            return 0;
        }

        return max(height(root->left)+1, height(root->right)+1);
    }
};