leetcode104 C++ 4ms 二叉树的最大深度

/**
 * 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 maxDepth(TreeNode* root) {
        if(root==nullptr){
            return 0;        
        }
        int left = maxDepth(root->left);
        int right = maxDepth(root->right);
        int res = left >= right? left:right;
        return 1 + res;
    }
};

leetcode104 C++ 4ms 二叉树的最大深度

原文：https://www.cnblogs.com/theodoric008/p/9380188.html