c_cpp 104.二叉树的最大深度 - 难度易 - 2018.9.10

Posted 2021-05-14

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int depper(TreeNode *r, int curMax) {
        if (r == NULL) return curMax;
        return max(depper(r->left, curMax+1), depper(r->right, curMax+1));
    }
    int maxDepth(TreeNode* root) {
        return depper(root, 0);
    }
};