[Python 3]Balanced Binary Tree. Beats 99.5%
Logic: From root, travel to both left sub-tree and right sub-tree\n\nclass Solution:\n    def isBalanced(self, root: TreeNode) -> bool:\n        \n        if no
**Logic:** From root, travel to both left sub-tree and right sub-tree\n```\nclass Solution:\n    def isBalanced(self, root: TreeNode) -> bool:\n        \n        if not root:\n            return 1\n        \n        def check(node):\n            if not node:\n                return 0\n            \n            lef = check(node.left)\n            rig = check(node.right)\n            \n            if lef==-1 or rig==-1 or abs(lef-rig)>1:\n                return -1\n            \n            return 1+ max(lef,rig)\n            \n            \n        if check(root)!=-1:\n            return 1\n        else:\n            return 0 \n```
['Python']