[leetcode] Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

原创最新推荐文章于 2024-10-15 15:32:42 发布 · 347 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种求解二叉树最大深度的有效算法。通过递归方式遍历树的每一层，找到从根节点到最远叶节点的最长路径长度。文章提供了详细的C++实现代码，帮助读者理解算法原理及其实现细节。

From : https://leetcode.com/problems/maximum-depth-of-binary-tree/

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

/**
 * 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) {
        int mdp;
        maxDepthCore(root, mdp, 0);
        return mdp;
    }
    void maxDepthCore(TreeNode* node, int& dep, int cur) {
        if(!node && dep<cur) {
            dep = cur;
            return;
        }
        if(node) {
            maxDepthCore(node->left, dep, cur+1);
            maxDepthCore(node->right, dep, cur+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;
		return 1+max(maxDepth(root->left), maxDepth(root->right));	
    }
};