Skip to content

Practice Balanced Binary Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#110
LeetCode Problem

Balanced Binary Tree

TreeDepth-First SearchBinary Tree

Problem Statement

Given a binary tree, determine if it is height-balanced.

Source: Balanced Binary Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [3,9,20,null,null,15,7]
Output
true

# Example 2

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].
-10^4 <= Node.val <= 10^4

Related LeetCode Problems

Practice more problems similar to Balanced Binary Tree.

94 Binary Tree Inorder Traversal Easy98 Validate Binary Search Tree Medium99 Recover Binary Search Tree Medium100 Same Tree Easy101 Symmetric Tree Easy
← Previous Convert Sorted List to Binary Search TreeNext → Minimum Depth of Binary Tree

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free