LeetCode 110. Balanced Binary Tree

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

解法：题目不难，总是算左右字数的高度，注意一点，java没有c++里面的引用，ans写成全局变量。

110. Balanced Binary Tree

Description Hints Submissions Discuss Solution

Pick One

---

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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

    3
   / \
  9  20
    /  \
   15   7

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

       1
      / \
     2   2
    / \
   3   3
  / \
 4   4