LeetCode - Balanced Binary Tree (Java)

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. Thoughts 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;

Read full article from LeetCode – Balanced Binary Tree (Java)