Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· trees Mock interview

Balanced Binary Tree

Given the root of a binary tree, return true if it is height-balanced: for every node, the heights of its two subtrees differ by at most 1.

Examples

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

out: true

balanced

in: root = [1,2,2,3,3,null,null,4,4]

out: false

left side too deep

Constraints

0 <= number of nodes <= 5000
-10^4 <= node value <= 10^4

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit