Question
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 differs by more than 1.
https://oj.leetcode.com/problems/balanced-binary-tree/
*Difficulty: Easy, Frequency: High
My Solution - Top-down recursion
runtime: O(n^2), stack space O(n)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null) return true;
if(Math.abs(depth(root.left)-depth(root.right)) > 1) return false;
return isBalanced(root.left) && isBalanced(root.right);
}
public int depth(TreeNode node){
int depth = 0;
if(node == null) return 0;
return Math.max(depth(node.left),depth(node.right))+1;
}
}
Bottom-up recursion
上面的方法,会对每一个node的maxDepth进行重复计算,故用bottom-up的方法更有效。从leaf往上,如果左右有不是balanced记depth为-1,看到-1立即返回
O(n) runtime, O(n) stack space
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isBalanced(TreeNode root) {
if(root == null) return true;
if(Math.abs(depth(root.left)-depth(root.right)) > 1) return false;
return isBalanced(root.left) && isBalanced(root.right);
}
public int depth(TreeNode node){
int depth = 0;
if(node == null) return 0;
return Math.max(depth(node.left),depth(node.right))+1;
}
}