Balanced Binary Tree 判断是否为平衡二叉树 解法集合(二)
l isBalanced8(TreeNode *root) {
// Note: The Solution object is instantiated only once and is reused by each test case.
int depth;
return f(root, depth);
}