首页 > 代码库 > [leetcode]Balanced Binary Tree
[leetcode]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.
算法思路：
求出各个子树是否是平衡二叉树。为了防止多余计算，最好采取后序遍历。
代码如下：
1 public class Solution { 2 public boolean isBalanced(TreeNode root) { 3 if(root == null || (root.left == null && root.right == null)) 4 return true; 5 if(!isBalanced(root.left) || !isBalanced(root.right)) 6 return false; 7 int left = getHeight(root.left); 8 int right = getHeight(root.right); 9 if(Math.abs(right - left) > 1) return false;10 return true;11 }12 13 private int getHeight(TreeNode root){14 if(root == null) return 0;15 if(root.left == null && root.right == null) return 1;16 int left = 0,right = 0;17 if(root.left != null) left = getHeight(root.left);18 if(root.right != null) right = getHeight(root.right);19 return Math.max(left, right) + 1;20 }21 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。