104. Maximum Depth of Binary Tree

请看题

Example

思路

和Minimun Depth of Binary Tree 一样，不过条件反过来了。

Minimun Depth of Binary Tree

不多讲了

---

Code

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

---

结束。