leetcode day12 二叉树的最大深度

1.题目描述

2.代码构思（debug）

class Solution:

	def maxDepth(self, root: TreeNode) -> int:
		def height(node):

           if not node:
           	    return 0

        	left = height(node.left)
       	    right = height(node.right)

        	return max(left,right) + 1

    	return height(root)
1
2
3
4
5
6
7
8
9
10
11
12

二叉树最小深度

class Solution:

def minDepth(self, root: TreeNode) -> int:
    if not root:
        return 0
    
    if not root.left and not root.right:
        return 1
    
    min_depth = 99999999999

    if root.left:
        min_depth = min(self.minDepth(root.left), min_depth)
    if root.right:
        min_depth = min(self.minDepth(root.right), min_depth)
    
    return min_depth + 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15