• Home
• com.github.javadev
• leetcode-in-java
• 1.17
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0101_0200.s0110_balanced_binary_tree.readme.md Maven / Gradle / Ivy

110\. Balanced Binary Tree

Easy

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 left and right subtrees of _every_ node differ in height by no more than 1.

**Example 1:**

![](https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg)

**Input:** root = [3,9,20,null,null,15,7]

**Output:** true 

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg)

**Input:** root = [1,2,2,3,3,null,null,4,4]

**Output:** false 

**Example 3:**

**Input:** root = []

**Output:** true 

**Constraints:**

*   The number of nodes in the tree is in the range `[0, 5000]`.
*   -104 <= Node.val <= 104