Check for Balanced Tree(O(n*n) solution)

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


bool isBalanced(Node *root)
{
    
    if(root==NULL)
     return true;
     
     
    bool x=isBalanced(root->right);
    bool y=isBalanced(root->left);
    bool z=abs(height(root->left)-height(root->right))<=1;
    
    return (x && y && z);
    
 
    
    
    
    
    
    
    
    
}