Check if Binary Tree is Balanced

Given the root of a binary tree, return true if the tree is height-balanced, otherwise return false. A binary tree is considered height-balanced if for every node in the tree, the height difference between its left and right subtrees is not more than 1.

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.