首页 > 代码库 > Balanced Binary Tree
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.
判断树的左右子树高度是否均衡 只要分别测出左右子树的深度即可 要注意的是 题目其实要求各子树也满足此条件才返回TRUE所以要对各个节点进行判断 代码如下;
public class Solution { public boolean isBalanced(TreeNode root) { if(root==null)return true; if(supisBalanced(root)){ return isBalanced(root.left)&&isBalanced(root.right); }else{ return false; } } public boolean supisBalanced(TreeNode root) { if(root==null)return true; int l=deepth(root.left); int r=deepth(root.right); if(l-r>=-1&&l-r<=1)return true; return false; } public int deepth(TreeNode root){ if(root==null)return 0; if(root.left==null&&root.right==null)return 1; int res=0; res=1+Math.max(deepth(root.left),deepth(root.right)); return res; } }
Balanced Binary Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。