LeetCode – Balanced Binary Tree (Java)
Given a binary tree, determine if it is heightbalanced.
For this problem, a heightbalanced 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.
Analysis
This is a typical tree problem that can be solve by using recursion.
Java Solution
// Definition for binary tree 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 (getHeight(root) == 1) return false; return true; } public int getHeight(TreeNode root) { if (root == null) return 0; int left = getHeight(root.left); int right = getHeight(root.right); if (left == 1  right == 1) return 1; if (Math.abs(left  right) > 1) { return 1; } return Math.max(left, right) + 1; } } 
<pre><code> String foo = "bar"; </code></pre>

Matias SM

Ankit Shah

Parth Solanki

Neel Sheyal

lcheng

Dhvl