# 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: TreeNode) -> int:
if root == None:
return 0
else:
return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1
LeetCode短期刷题 树的最大深度
猜你喜欢
转载自www.cnblogs.com/lywangjapan/p/12421633.html
今日推荐
周排行