[LeetCode]Maximum depth of binary tree (완료)

[yeonghwanjeon]

• 문제링크
• 문제 풀이
  • Recursive 가능
  • Iterative의 경우, BFS로 가능 (HackerRank 문제에서 품)

    
    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None

class Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if root is None : return 0

    return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1