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

//c++递归
/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */

#include <algorithm>
#include <cstddef>
#include <iterator>
#include <stack>
#include <vector>
class Solution {
public:
    /**
     * 
     * @param root TreeNode类 
     * @return int整型
     */
    int maxDepth(TreeNode* root) {
        // write code here
        // vector<int> res;
        if (root==NULL) {
            return 0;
        }
        return max(maxDepth(root->left),maxDepth(root->right))+1;

        
    }
};