Balanced Binary Tree — Easy Coding Interview Question

Given a binary tree, determine if it is height-balanced: a binary tree in which the depth of the two subtrees of every node never differs by more than one.

Example

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

Output: true

Constraints

• The number of nodes is in the range [0, 5000]
• -10⁴ ≤ Node.val ≤ 10⁴

Topics & Companies

Topics: trees

Asked by: Amazon, Google, Meta

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(h).

Practice more

• All DSA Problems
• DSA Patterns