104. Maximum Depth of Binary Tree
2025. 10. 5. 20:26ㆍAlgorithm/Leetcode, Lintcode, HackerRank, etc.
- 목차
반응형
class Solution:
def maxDepth(self, root: Optional[TreeNode]) -> int:
def dfs(node):
if not node:
return 0
l = dfs(node.left)
r = dfs(node.right)
return max(l, r) + 1
return dfs(root)반응형
'Algorithm > Leetcode, Lintcode, HackerRank, etc.' 카테고리의 다른 글
| 53. Maximum Subarray (0) | 2025.10.07 |
|---|---|
| 1189. Maximum Number of Balloons (0) | 2025.10.07 |
| 417. Pacific Atlantic Water Flow (0) | 2025.10.05 |
| flood fill (0) | 2025.10.05 |
| 3100. Water Bottles II (0) | 2024.04.05 |
