Leetcode/python/104_maximum_depth_of_binary_tree.py
2024-04-30 16:56:00 +01:00

6 lines
195 B
Python

class Solution:
def maxDepth(self, root: Optional[TreeNode]) -> int:
if root is None:
return 0
return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1