104. Maximum Depth of Binary Tree

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

niunc

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

阅读量95

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/niunc/article/details/81915037

LeetCode 专栏收录该内容

185 篇文章

订阅专栏

本文介绍了一种计算二叉树最大深度的方法。通过递归遍历左右子树并比较其深度，返回较大者加一作为当前节点的最大深度。此算法应用于LeetCode题目“二叉树的最大深度”，示例中给出的二叉树结构为[3,9,20,null,null,15,7]，计算得到的最大深度为3。

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

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

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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

return its depth = 3.

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root == None:
            return 0
        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))