[LeetCode] Maximum Depth of Binary Tree 파이썬 (recursion)

40ms

class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution:
    # @param root, a tree node
    # @return an integer
    def maxDepth(self, root):
        if root is None:
            return 0
        else:
            return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1

출처:github.com/jiapengwen/LeetCode/blob/master/Python/maximum-depth-of-binary-tree.py

 

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if not root: 
            return 0
        
        left_level = self.maxDepth(root.left) + 1 
        right_level = self.maxDepth(root.right) + 1 
        
        return max(left_level, right_level)