[리트코드 leetcode] 104. Maximum Depth of Binary Tree

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

Maximum Depth of Binary Tree - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

# 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: TreeNode) -> int:
        if not root:
            return 0
        
        output = []
        depth=1
        
        def nodeCheck(node,depth):
            if node.left:
                nodeCheck(node.left,depth+1)
        
            if node.right:
                nodeCheck(node.right,depth+1)
               
            output.append(depth)       
          
        nodeCheck(root,depth)
        return max(output)

# 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: TreeNode) -> int:
        
        max_dep = []
        
        def dfs(node, depth):
            if not node :
                max_dep.append(depth)
                return
            
            dfs(node.left, depth+1)
            dfs(node.right, depth+1)
            
        dfs(root,0)
        return max(max_dep)