38. Balanced Binary Tree

Write a function solve that checks if a binary tree 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.

Example:
Input: [3,9,20,None,None,15,7]
Output: True

Run this challenge interactively in Python or JavaScript when the app loads.