mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-16 23:16:26 +00:00
feat(docs): add Maximum Depth of Binary Tree documentation
This commit is contained in:
@@ -0,0 +1,39 @@
|
|||||||
|
---
|
||||||
|
title: '104. Maximum Depth of Binary Tree'
|
||||||
|
description: Given the root of a binary tree, return its maximum depth
|
||||||
|
sidebar:
|
||||||
|
label: 'Maximum Depth of Binary Tree'
|
||||||
|
badge: 'Easy'
|
||||||
|
---
|
||||||
|
|
||||||
|
<Badge variant="accent">Tree DFS</Badge>
|
||||||
|
|
||||||
|
### 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^4].
|
||||||
|
- `-100 <= Node.val <= 100`
|
||||||
|
|
||||||
|
## Solution
|
||||||
|
|
||||||
|
```py
|
||||||
|
# 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 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))
|
||||||
|
```
|
||||||
Reference in New Issue
Block a user