[Leetcode] 0104. Maximum Depth of Binary Tree

Explore diverse LeetCode solutions in Python, C++, JavaScript, SQL, and TypeScript. Ideal for interview prep, learning, and code practice in multiple programming languages. Github Repo Link

Table of contents

Easy

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: 3

Example 2:

Input: root = [1,null,2]
Output: 2

Constraints:

The number of nodes in the tree is in the range [0, 10 ⁴ ].
-100 <= Node.val <= 100

Python

				
					# 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: def longestPath(node: Optional[TreeNode]): if not node: return 0 leftPath = longestPath(node.left) rightPath = longestPath(node.right) return max(leftPath, rightPath)+1 return longestPath(root)

Easy

Python

related articles