首页 > 代码库 > Problem Balanced Binary Tree
Problem Balanced Binary Tree
Problem Description:
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.
Solution:
1 public boolean isBalanced(TreeNode root) { 2 int[] height = new int[1]; 3 return isBalancedWithHeight(root, height); 4 } 5 6 public boolean isBalancedWithHeight(TreeNode root, int[] height) { 7 int[] lh = new int[1]; 8 int[] rh = new int[1]; 9 boolean l,r;10 11 if (root == null) {12 height[0] = 0;13 return true;14 }15 16 l = isBalancedWithHeight(root.left, lh);17 r = isBalancedWithHeight(root.right, rh);18 19 height[0] = ((lh[0] > rh[0])? lh[0] : rh[0]) + 1;20 21 return (Math.abs(lh[0]-rh[0]) < 2) && l && r;22 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。