数据结构与算法：第11周作业一：树的最大深度

题目描述

链接：https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/

代码

class Solution:
    def maxDepth1(self, root: TreeNode) -> int:
        if not root:
            return 0
        left=self.maxDepth1(root.left)+1
        right=self.maxDepth1(root.right)+1
        return max(left,right)

    def maxDepth2(self,root):
        if not root:
            return 0
        length=0
        templist=[]
        curtreelist=[]
        curtreelist.append(root)
        while curtreelist:
            for node in curtreelist:
                if node.left is not None:
                    templist.append(node.left)
                if node.right is not None:
                    templist.append(node.right)
                curtreelist=templist
                templist=[]
            length+=1