check_whether_given_tree_is_balanced_or_not.cpp

int height(Node *root)
{
    if (root==NULL)
        return 0;
        return (1+max(height(root->left),height(root->right)));
}

bool isBalanced(Node *root)
{
    //  Your Code here
    int lh,rh=0;
    if(root==NULL)
        return 1;
 
    lh=height(root->left);
    rh=height(root->right);
    if(abs(lh-rh)<=1 &&
        isBalanced(root->left)&&
        isBalanced(root->right))
      
        return 1;
    
     return 0;
}