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.

URL: https://leetcode.com/problems/minimum-depth-of-binary-tree/

import sys
# 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
        """
        if root == None:
            return 0

        if root.left == None and root.right == None:
            return 1

        if root.left != None:
            left = self.minDepth(root.left)
        else:
            left = sys.maxsize

        if root.right != None:
            right = self.minDepth(root.right)
        else:
            right = sys.maxsize

        return 1 + min(left, right)