二叉树的最大深度
1,通过遍历来找到树的最大深度
2,创捷一个实例属性,记录深度
3,返回该属性
class Solution(object):
def __init__(self):
self.z = float("-inf")
def maxDepth(self, root):
"""
:type root: TreeNode
:rtype: int
"""
if not root:
return 0
root.val = 1
self.shu(root)
return self.z
def shu(self, root):
if root is None:
return 0
self.z = max(self.z, root.val)
if root.left is not None:
root.left.val = root.val + 1
if root.right is not None:
root.right.val = root.val + 1
self.shu(root.right)
self.shu(root.left)