[LeetCode]111. 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

Solution: 树的遍历，递归方法

Running Time: O(n)

# Definition for a  binary tree node
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    # @param root, a tree node
    # @return an integer
    def minDepth(self, root):
        if root is None:
            return 0
        if root.left is None and root.right is None:
            return 1
        else:
            leftMin = self.minDepth(root.left)
            rightMin = self.minDepth(root.right)
            if root.left is None:
                leftMin = pow(2,31)#can not import sys to use sys.maxint here
            if root.right is None:
                rightMin = pow(2,31)
            return min(leftMin, rightMin) + 1