Check Binary Tree Is Balanced

You are given the root of a **binary tree**. Your task is to determine whether the binary tree is **height-balanced**. A binary tree is considered **balanced** if: - For **every node**, the difference between the heights of its left and right subtrees is **at most 1**. - Both the left and right subtrees are themselves **balanced**. Return **`true`** if the tree is balanced; otherwise, return **`false`**.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.