Python O(N) Solution - Beats 100%
O(N) Python solution with single recursive pass. Beats 100%.  ``` class Solution(object):     def isBalanced(self, root):         """         :type root: TreeNo
O(N) Python solution with single recursive pass. Beats 100%. 

```
class Solution(object):
    def isBalanced(self, root):
        """
        :type root: TreeNode
        :rtype: bool
        """
        return self.getBalancedHeight(root, 0) >= 0
        
    def getBalancedHeight(self, root, height):
        
        if not root:
            return height
        
        l = self.getBalancedHeight(root.left, height+1)
        r = self.getBalancedHeight(root.right, height+1)
        
        if l == -1 or r == -1 or abs(l-r) > 1:
            return -1
        
        return max(l, r) 
```


[]