Balanced Binary Tree (Java)

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.

Source

/**
 * Definition for binary tree
 * 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;
		if(height(root) == -1)
			return false;
		return true;
    }
    public int height(TreeNode root){
		int left,right;
		if(root == null)
			return 0;
		
		left = height(root.left);
		right = height(root.right);
		
		if(left == -1 || right == -1)
			return -1;
		if(Math.abs(left - right) > 1)
			return -1;
		return Math.max(left, right) + 1;
	}
}

测试

public static void main(String args[]){
		TreeNode head = new TreeNode(0);
		head.left = new TreeNode(1);
		head.right = new TreeNode(2);
		head.left.left = new TreeNode(3);
		head.left.left.left = new TreeNode(4);
		System.out.println(isBalanced(head));
		
	}