【leetcode】111. 二叉树的最小深度（python）

详看【官方题解】 and 【题解】

note: 递归结束条件

• 当 root 节点左右孩子都为空时，返回 1
• 当 root 节点左右孩子有一个为空时，返回不为空的孩子节点的深度
• 当 root 节点左右孩子都不为空时，返回左右孩子较小深度的节点值

递归（深度优先，DFS）

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root == None:
            return 0
        if root.left == None and root.right == None:
            return 1
        min_depth = 10**9
        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

非递归（广度优先, BFS）

import collections

class Solution(object):
    def minDepth(self, root):
        if not root:
            return 0
        que = collections.deque([(root, 1)])
        while que:
            node, depth = que.popleft()
            if not node.left and not node.right:
                return depth
            if node.left:
                que.append((node.left, depth + 1))
            if node.right:
                que.append((node.right, depth + 1))
        return 0

记录一下我的野路子

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):   # 已AC
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return 0
        nl = self.minDepth(root.left)
        nr = self.minDepth(root.right)
        if nl == 0:    # 单支树
            return nr + 1
        elif nr == 0:
            return nl + 1
        else:
            return min(nl, nr) + 1

仅take notes