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

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param root TreeNode类 
     * @return int整型
     */
    int maxDepth(TreeNode* root) {
        // write code here
        if(root==nullptr)
            return 0;
        else
        {
            int l=maxDepth(root->left);
            int r=maxDepth(root->right);
            return l>r?l+1:r+1;
        }
        
    }
};