(Python, Java) 리트코드 - Maximum Depth of Binary Tree

07 Apr 2022 in Algorithm on Leetcode

[문제 링크]

Python 풀이

class Solution:
    def maxDepth(self, root: Optional[TreeNode]) -> int:
        if root is None:
            return 0

        left = self.maxDepth(root.left)
        right = self.maxDepth(root.right)

        return max(left, right) + 1

Java 풀이

class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null)
            return 0;
        
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        return Math.max(left, right) + 1;
    }
}