leetcode:二叉树的最大深度

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class :
    def maxDepth(self, root: TreeNode) -> int:
        if root!=None:
            return max(self.maxDepth(root.left),self.maxDepth(root.right))+1
        else:
            return 0