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

/**
 * 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
        int dep=1;
        int right,left=0;
        if(root==nullptr) return 0;
        else 
        {
            left=maxDepth(root->left);
            right=maxDepth(root->right);
            if(left>=right) dep=1+left;
            else dep=1+right;
            return dep;
        }
       
    }
};