二叉树最大深度 递归 - lifengyu360/lifengyu_first_git_test GitHub Wiki

class Solution {

public:

int maxDepth(TreeNode* root) {
    if (root == nullptr) return 0;
    return max(maxDepth(root->left), maxDepth(root->right)) + 1;
}

};