Balanced Binary Tree

Easy Binary Trees

Log in to solve

A tree is height-balanced if for every node the heights of its two subtrees differ by at most one. Print true or false.

Constraints

0 <= number of nodes <= 5000

No discussions yet.