4.1 Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.
LeetCode上的原題，請參見我之前的部落格Balanced Binary Tree 平衡二叉樹。