104.Maximum Depth of Binary Tree

 

 

 

 

# 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:
        if root == None:
            return 0
        return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))

 

posted @ 2020-05-09 14:32  星海寻梦233  阅读(63)  评论(0编辑  收藏  举报