【每日一题Leetcode】104. Maximum Depth of Binary Tree

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode刷刷刷专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种使用递归方法求解二叉树最大深度的算法。通过检查每个节点及其左右子节点来确定从根节点到最远叶子节点的路径长度。

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.

思路：这个题的重点是返回最大深度。递归方法检查每个node是否存在，如果存在进一步检查node.left和node.right，返回最大的一个。

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

class Solution:
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """

        if root == None:
            return 0
        else:
            return 1 + max(self.maxDepth(root.left),self.maxDepth(root.right))
         
        
 
        return