[LeetCode]104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
class Solution(object):
res = 1
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
def helper(cur, path):
if not cur:
return
self.res = max(self.res, path)
if cur.left:
helper(cur.left, path + 1)
if cur.right:
helper(cur.right, path + 1)
if not root:
return 0
helper(root, 1)
return self.res
class Solution(object):
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
return 0 if not root else max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1
![](https://i.loli.net/2018/11/17/5beff4d639cbb.jpg)
关注公众号:数据结构与算法那些事儿,每天一篇数据结构与算法