(( C++ )) 99% Short Short Solution - No Comments + Hard To Read
\nclass Solution {\npublic:\n    bool isBalanced(TreeNode* root) {\n        int aDepth = 0;\n        return isBalanced(root, aDepth);\n    }\n    \n    bool isB
```\nclass Solution {\npublic:\n    bool isBalanced(TreeNode* root) {\n        int aDepth = 0;\n        return isBalanced(root, aDepth);\n    }\n    \n    bool isBalanced(TreeNode *root, int &depth) {\n        if (root == NULL) return true;\n        int aLeftHeight = depth + 1, aRightHeight = depth + 1;\n        if (!isBalanced(root->left,  aLeftHeight ) || !isBalanced(root->right, aRightHeight)) { return false; }\n        depth = max(aLeftHeight, aRightHeight);\n        if (abs(aLeftHeight - aRightHeight) > 1) { return false; }\n        return true;\n    }\n    \n};\n```\n\nBasically, this is a win.
[]