프로그래밍/LeetCode
[LeetCode][Python3] 104. Maximum Depth of Binary Tree
snoopybox
2018. 9. 27. 00:32
Problem :
https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
My Solution :
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
if not root:
return 0
return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))