파비의 매일매일 공부기록

2023.02.16 Today's Challenge 본문

Problem Solving/LeetCode

2023.02.16 Today's Challenge

fabichoi 2023. 2. 16. 23:45

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

 

Maximum Depth of Binary Tree - LeetCode

Can you solve this real interview question? Maximum Depth of Binary Tree - 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

leetcode.com

간단한 순회 문제!

class Solution:
    def maxDepth(self, root: Optional[TreeNode]) -> int:
        def dfs(root, depth):
            if not root:
                return depth
            return max(dfs(root.left, depth+1), dfs(root.right, depth+1))
        return dfs(root, 0)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.02.18 Today's Challenge  (0) 2023.02.18
2023.02.17 Today's Challenge  (0) 2023.02.17
2023.02.15 Today's Challenge  (0) 2023.02.15
2023.02.14 Today's Challenge  (0) 2023.02.14
2023.02.13 Today's Challenge  (0) 2023.02.13
'Problem Solving/LeetCode' Related Articles more
Comments