Given a binary tree with $n$ nodes, return TRUE if it is height-balancedA binary tree is considered height-balanced if the difference between the heights of the two subtrees for each node is not more than 1.. 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 take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.