Balanced Binary Tree

Problem:

Given a binary tree, determine if it is height-balanced.



For this problem, a height-balanced binary tree is defined as if the difference between the depths of any two leaf nodes is no greater than one.

Hints and Answer Checklist