【leetcode】二叉树的最大深度

int maxDepth(struct TreeNode* root){
    if (!root) return 0;
    int left = maxDepth(root->left);
    int right = maxDepth(root->right);
    return (left > right)? left+1 : right+1;
}