/* 解题思路: 二叉树的最大深度等价于:左右子树的最大深度 + 1 */
int maxDepth(struct TreeNode* root){
if(root == NULL) {
return 0;
}
size_t left = maxDepth(root->left) + 1;
size_t right = maxDepth(root->right) + 1;
if(right > left) {
return right;
}
return left;
}