美文网首页算法,写代码
[easy][Tree]104. Maximum Depth o

[easy][Tree]104. Maximum Depth o

作者: 小双2510 | 来源:发表于2017-11-06 04:13 被阅读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.

代码是:

# 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 
        elif not (root.left or root.right):
            return 1
        
        return max(self.maxDepth(root.left),self.maxDepth(root.right)) + 1

相关文章

网友评论

    本文标题:[easy][Tree]104. Maximum Depth o

    本文链接:https://www.haomeiwen.com/subject/orskmxtx.html