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

1.递归 啥也不是

/**
 * 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;
        }
        return 1 + max(maxDepth(root->left),maxDepth(root->right));
    }
};