110. Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Subscribe to see which companies asked this question.

Solution:

Tips:

Tree, recursion

Java Code:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isBalanced(TreeNode root) {
        if (null == root) {
            return true;
        }
        return treeDepth(root) != -1;
    }
    
    public int treeDepth(TreeNode root) {
        if (null == root) {
            return 0;
        }
        
        int leftDepth = treeDepth(root.left);
        if (-1 == leftDepth) {
            return -1;
        }
        int rightDepth = treeDepth(root.right);
        if (-1 == rightDepth) {
            return -1;
        }
        
        if (Math.abs(leftDepth - rightDepth) > 1) {
            return -1;
        }
        
        return Math.max(leftDepth, rightDepth) + 1;
    }
}