Balanced Binary Tree

Given a binary tree, determine if it is

public class Solution {

	public boolean NotBalancedflag;
	public boolean isBalanced(TreeNode root) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		NotBalancedflag = false;
		checkBalanced(root);
		if (NotBalancedflag)
			return false;
		else
			return true;
	}

	public int checkBalanced(TreeNode root) {
		if (NotBalancedflag == true)
			return -1;
		if (root == null)
			return 0;
		int leftDepth = checkBalanced(root.left);
		int rightDepth = checkBalanced(root.right);
		if (java.lang.Math.abs(leftDepth - rightDepth) > 1) {
			NotBalancedflag = true;
		}
		return java.lang.Math.max(leftDepth, rightDepth) + 1;
	}

}

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.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值