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.
Copyright © 2017 1TakeInterview LLC. All rights reserved.
100 Ridgewood Road, Ithaca, NY US 14850