Q104 Maximum Depth of Binary Tree

echobingo

发布于 2018-04-25 16:50:28

5940

发布于 2018-04-25 16:50:28

文章被收录于专栏：Bingo的深度学习杂货店

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.

For example:

Given binary tree [3,9,20,null,null,15,7],
    3
   / \
  9  20
    /  \
   15   7
return its depth = 3.

解题思路：

分别找到左右子树最大深度。每递归一次，深度加1。

Python实现：

# 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
        return max(Solution.maxDepth(self, root.left), Solution.maxDepth(self, root.right)) + 1  # 每递归一次，深度加1

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018.02.28 ，如有侵权请联系 cloudcommunity@tencent.com 删除

python