首页 > 代码库 > 31: Balanced Binary Tree
31: Balanced Binary Tree
/*
* 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.
* */
//判断二叉平衡树：
//
public boolean isBalanced(TreeNode root) { if(root==null) { return false; } if (root.right==null&&root.left==null) { return true; } int a = maxDepth(root.left); int b = maxDepth(root.right); boolean suba = isBalanced(root.left); boolean subb = isBalanced(root.right); if(Math.abs(a-b)>1) { return false; } if (suba && subb) { return true; } return false; }
31: Balanced Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。