Leetcode 104. Binary Tree is the maximum depth problem-solving ideas and implemented in C ++

Disclaimer: This article is a blogger original article, shall not be reproduced without the bloggers allowed. https://blog.csdn.net/gjh13/article/details/90738048

Problem-solving ideas:

Using a recursive method, recursive depth compare left and right subtrees, return a larger value + 1.

/**
 * 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) return 0;
        else return max(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
};