Given a binary tree, determine if it is height-balanced. 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
Merge branch 'master' of https://github.com/rafaelfang/LeetCode