TOP101题解 | BM28#二叉树的最大深度#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 * @author Senky
 * @date 2023.08.01
 * @par url https://www.nowcoder.com/creation/manager/content/584337070?type=column&status=-1
 * @brief 很常规
 * @param root TreeNode类 
 * @return int整型
 */
int maxDepth(struct TreeNode* root ) {
    // write code here
    if(root == NULL)
    {
        return 0;
    }

    int leftDepth = maxDepth(root->left);
    int rightDepth = maxDepth(root->right);

    return (leftDepth > rightDepth)?leftDepth + 1 : rightDepth + 1;
}