balanced binary tree c++ || time=O(n) || space = n
\n// if you like the solution then plz vote this solution\n\n\n\nclass Solution {\npublic:\n    bool b=true;\n   \n int hight(TreeNode*root){\n         if(root=
\n// if you like the solution then plz vote this solution\n\n\n```\nclass Solution {\npublic:\n    bool b=true;\n   \n int hight(TreeNode*root){\n         if(root==NULL) return 0;\n        int n1=hight(root->left) , n2=hight(root->right);\n         if(abs(n1-n2)>1) b=false;\n         return max(n1,n2)+1;           \n    }\n```\n\n\n    bool isBalanced(TreeNode* root) {\n         if(root==NULL) return true;  \n         hight(root);\n         return b;\n    }\n};
['Tree', 'Recursion', 'C', 'Binary Tree']