LeetCode - Maximum Depth of Binary Tree

最新推荐文章于 2025-08-08 21:26:37 发布

starcroce

最新推荐文章于 2025-08-08 21:26:37 发布

阅读量474

点赞数

CC 4.0 BY-SA版权

文章标签： leetcode binary tree

本文链接：https://blog.youkuaiyun.com/starcroce/article/details/18219553

本文介绍了一种使用递归方法来确定二叉树的最大深度的算法实现。通过计算从根节点到最远叶子节点的最长路径上的节点数量，可以得到二叉树的最大深度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

http://oj.leetcode.com/problems/maximum-depth-of-binary-tree/

Solution:

Pretty fundamental, recursively get the max depth of the binary tree

https://github.com/starcroce/leetcode/blob/master/maximum_depth_of_binary_tree.cpp

// 48 ms for 38 test cases
/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(root == NULL){
            return 0;
        }
        int left_depth = maxDepth(root->left);
        int right_depth = maxDepth(root->right);
        return max(left_depth, right_depth) + 1;
    }
};