题解 | 二叉树的最大深度

from re import S
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param root TreeNode类 
# @return int整型
#
class Solution:

    deep_num = 0

    def maxDepth(self , root: TreeNode) -> int:
        # write code here
        if root:
            if not root.left and not root.right:
                return 1
            return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))
        else:
            return 0