LeetCode - Balanced Binary Tree

Click here to go back to LeetCode summary page.

Problem description is here, or as follows:

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. 

• Solution 1: Python