Problem: Check if a binary tree is balanced.
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.

Give a simple solution with complexity O(logn logn)