LeetCode@Tree_110_Balanced_Binary_Tree

110. Balanced Binary Tree

Description Hints Submissions Solutions

• Total Accepted: 172600
• Total Submissions: 465133
• Difficulty: Easy
• Contributor: LeetCode

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.

Hide Tags

  Tree  Depth-first Search

Hide Similar Problems

java:

/**
 * 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(root == null)
		{
			return true;
		}
		else
		{
			return Math.abs(maxDepth(root.right) - maxDepth(root.left))<=1 
					&& isBalanced(root.right)
					&& isBalanced(root.left);
		}
	}

	public int maxDepth(TreeNode root)
	{
		int h = 0;
		if (root == null)
		{
			return h;
		}
		else
		{
			return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
		}

	}
}