LeetCode Balanced Binary Tree

最新推荐文章于 2024-09-24 08:39:28 发布

Desperado_Sage

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量482

点赞数

分类专栏： LeetCode 文章标签： leetcode algorithm back-order traversal

本文链接：https://blog.csdn.net/desperado_sage/article/details/19537089

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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 class Solution {
public boolean isBalanced(TreeNode root) {
if (root == null) return true;
if (Math.abs(maxdeep(root.left) - maxdeep(root.right)) > 1) return false;

return isBalanced(root.left)&&isBalanced(root.right);
}
public int maxdeep(TreeNode root){
if (root == null) return 0;

return Math.max(maxdeep(root.left), maxdeep(root.right)) + 1;

}

}

Time Complexity: O(n^2)

Solution 2:

public class Solution {
   public boolean isBalanced(TreeNode root) {
return BackOrderT(root) > -1;
}

public int BackOrderT(TreeNode root){
if (root == null) return 0;
int leftDep = BackOrderT(root.left);
int rightDep = BackOrderT(root.right);
if ( (Math.abs(leftDep - rightDep) > 1)||(leftDep == -1)||(rightDep == -1) ) return -1;
return Math.max(leftDep + 1, rightDep + 1);

}

}