LC-0111 Easy LeetCode

111. Minimum Depth of Binary Tree

Tree Depth-First Search Breadth-First Search Binary Tree

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 50% Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree

Reading material

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(h), h is height of binary tree

class TreeNode(object):
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None

class Solution(object):
    # @param root, a tree node
    # @return an integer
    def minDepth(self, root):
        if root is None:
            return 0

        if root.left and root.right:
            return min(self.minDepth(root.left), self.minDepth(root.right)) + 1
        else:
            return max(self.minDepth(root.left), self.minDepth(root.right)) + 1

Solution from kamyu104/LeetCode-Solutions · MIT