Back to DSA sheet

Balanced Binary Tree

EasyBinary Trees
Open on LeetCodeAmazonGoogle

Return true if a binary tree is height-balanced, meaning every node's two subtrees differ in height by at most one.

Constraints
  • 0 <= nodes <= 5000
  • -10^4 <= Node.val <= 10^4
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
balanced-binary-tree.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.