leetcode#104 Maximum Depth of Binary Tree

1. 문제

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

2. 나의 풀이

2-1. 재귀함수를 이용한 방법

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        
        result = []
        
        def depth(node, maxHeight):
            if node and node.left:
                depth(node.left, maxHeight+1)
            if node:
                result.append(maxHeight+1)
            if node and node.right:
                depth(node.right, maxHeight+1)
            
            result.append(maxHeight)
        
        depth(root, 0)
        # print(result)
        return max(result)

3. 남의 풀이