DSA/110. Balanced Binary Tree.cpp at main · twopieare/DSA · 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
/**
 * 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 height(TreeNode* root){
        if(root==nullptr) return 0;
        return 1+max(height(root->left), height(root->right));
    }

    bool isBalanced(TreeNode* root) {
        TreeNode* temp = root;
        if(temp!=nullptr){
            int left = height(temp->left);
            int right = height(temp->right);

            if(abs(left-right) > 1){
                return false;
            }
            if(isBalanced(temp->right)==false){
                return false;
            }
            if(isBalanced(temp->left)==false){
                return false;
            }
        }
        return true;
    }
};