98. Balanced Binary Tree

EasyTree

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

Examples

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

Output: true

Explanation: Every node's two subtrees differ in height by at most 1.

Constraints

  • The number of nodes in the tree is in the range [0, 5000].
  • -10^4 <= Node.val <= 10^4
Loading...

Run checks all cases above. Submit evaluates all test cases.