Solved-Practice-Questions-CP-/Tree2.cpp at master · mallocash05/Solved-Practice-Questions-CP- · 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


//https://leetcode.com/problems/balanced-binary-tree/

//110. Balanced Binary Tree


/**
 * 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 value  = true;

    int  Utilsbalanced(TreeNode* root ){
    if(root == NULL)
        return 0;

    int lh = Utilsbalanced(root->left);
    int rh = Utilsbalanced(root->right);

    if(abs(lh-rh)>1){

        value =  false;

        }
    int res = max(lh,rh);
    return res+1;

    }
    bool isBalanced(TreeNode* root) {
        value = true;
        int res = Utilsbalanced(root);
        //cout<<value<<endl;
        return value;


    }
};