LeetCode: 104. Maximum Depth of Binary Tree

最新推荐文章于 2020-04-01 13:57:34 发布

liveway6

最新推荐文章于 2020-04-01 13:57:34 发布

阅读量160

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/liveway6/article/details/96298531

版权

LeetCode 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

题目

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

解题思路

做完了LeetCode: 102. Binary Tree Level Order Traversal和LeetCode: 103. Binary Tree Zigzag Level Order Traversal之后这道题就很简单了。直接代码复用，统计有多少个level就行。

# 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: TreeNode) -> int:
        res = 0
        if root is None:
            return res
        level = [root]
        while level:
            res += 1
            internode = []
            for node in level:
                internode.extend([node.left, node.right])
            level = [leaf for leaf in internode if leaf]
        return res