[LeetCode] [C] 104. Maximum Depth of Binary Tree

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C #Data Structure #Binary Tree

LeetCode 同时被 3 个专栏收录

7 篇文章

订阅专栏

Freshman

7 篇文章

订阅专栏

4 篇文章

订阅专栏

本文介绍了一种使用递归方法来寻找二叉树的最大深度的方法。通过定义辅助函数maxD来递归地遍历左右子树，并记录最大的深度值。最后返回这个最大深度值。

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

Talking about Binary Tree,

I will often think of Recursion.

To traverse the binary tree,

I always use Recursive Method.

So here, to find the maximum depth of binary tree,

I wrote another function to help me do this.

Because in this problem,

only using the function it gives is not convenient to use Recursive Method.

And I declared a variable "max" outside the function to storage the maximum depth,

so that I could use it in two functions.

The Runtime of the program is 3 ms.

The length of the code is 482 Bytes.

int max;
int maxD(struct TreeNode* p, int num) {
    num++;
    if (p->left) maxD(p->left, num);
    if (p->right) maxD(p->right, num);
    if (!(p->left) && !(p->right))
        if (num>max)
            max=num;
    return max;
}
int maxDepth(struct TreeNode* root) {
    max=0;
    if (!root) return 0;
    return maxD(root, 0);
}