Leetcode 104 Solution

This article provides solution to leetcode question 104 (maximum-depth-of-binary-tree)
Categories:
Tags:
Access this page by simply typing in "lcs 104" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/maximum-depth-of-binary-tree

Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def maxDepth(self, root: Optional[TreeNode]) -> int:
        if not root:
            return 0

        return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1