Balanced Binary Tree is an example of null problems. In this post we will see how we can solve in Javascript.

Problem Description

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

For this problem, a height-balanced binary tree is defined as a binary tree

in which the depth of the two subtrees of every node never differ by more than 1.

If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!