LeetCode 104 – Python 3 (Week 2 – 05)

Solution 1

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

Time complexity is O(n). Space complexity is O(n).