LeetCode 110. 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.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

Return false.


Create and use maxDepth() as a helper function. Check if the tree is balanced at the same time when we are calculating the max depth of the tree. If the tree is not balanced, use maxDepth() to return null as an indicator.

Video Tutorial

Java Solution

Leave a Reply

Your email address will not be published. Required fields are marked *