Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. A height-balanced binary tree is defined as a binary tree in which the left and right subtrees of every node differ in height by no more than 1.

Ada AI

I want to discuss a solution

Help me solve this

Give more examples

What's wrong with my code?

How to use 'for loop' in javascript?

javascript (node 13.12.0)

Stdin (editable)

Balanced Binary Treeself.__wrap_b(":R159l76:",1)

Balanced Binary Tree