Test your understanding of various coding challenges focusing on algorithm efficiency.

Central CIP Path

Challenge Yourself

# Statement

Given a binary tree with $n$ nodes, return TRUE if it is #key# height-balanced: A binary tree is considered height-balanced if the difference between the heights of the two subtrees for each node is not more than 1. #key#. Otherwise, return FALSE.

> **Note:** The height of an empty tree is $0$.

**Constraints:**

* $1 \leq n \leq 500$
* $-10^4 \leq$ `Node.data` $\leq 10^4$

Let's solve the Balanced Binary Tree problem using the Tree Depth-first Search pattern.

Solution: Balanced Binary Tree

Statement▼

Solution: Balanced Binary Tree

Statement▼