Leetcode: Minimum Depth of Binary Tree

Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

## Blog link: https://code.dennyzhang.com/minimum-depth-of-binary-tree
# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def minDepth(self, root):
        :type root: TreeNode
        :rtype: int
        ## Idea: DFS
        ## Complexity:
        depth = None
        if root is None:
            return 0
        if (root.left is None) and (root.right is None):
            return 1
        elif (root.left is None):
            return self.minDepth(root.right)+1
        elif (root.right is None):
            return self.minDepth(root.left)+1
            return min(self.minDepth(root.left)+1, self.minDepth(root.right)+1)

Share It, If You Like It.

Leave a Reply

Your email address will not be published.