balanced_binary_tree.cpp

/**
 * 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==NULL){
            return 0; 
        }
        else{
            return 1 + max(Height(root->left),Height(root->right)); 
                           
        }
    }
    bool isBalanced(TreeNode* root) {
        if(root==NULL){
            return true; 
        }
       int   lh=Height(root->left); 
       int  rh=Height(root->right);
        if(abs(lh-rh)<=1 && isBalanced(root->left) && isBalanced(root->right)){
            return true; 
             
            
        }
        return false; 
        

            
        }
   
    
};