L110_Balanced_Binary_Tree.java

package LeetCode;

public class L110_Balanced_Binary_Tree {

	public boolean isBalanced(TreeNode root) {

		if (root == null) {
			return true;
		}

		return Math.abs(height(root.left) - height(root.right)) <= 1
				&& isBalanced(root.left) && isBalanced(root.right);

	}

	int height(TreeNode node) {

		if (node == null) {
			return 0;
		}

		return Math.max(height(node.left), height(node.right)) + 1;
	}
}