# 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:
def MaxDepth(root):
if not root:
return 0
return 1+max(MaxDepth(root.left), MaxDepth(root.right))
return MaxDepth(root)