题解 | #二叉树的最大深度#

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param root TreeNode类 
# @return int整型
# 递归实现
class Solution:
    def getDepth(self , this: TreeNode):
        if not this:
            return 0
        else:
            return 1 + max(self.getDepth(this.left),self.getDepth(this.right))
    def maxDepth(self , root: TreeNode) -> int:
        # write code here
        return self.getDepth(root)