minimum-depth-of-binary-tree.txt

# 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 == None:
			return 0
		elif root.left == None and root.right == None:
			return 1
		else:
			leftRes = pow(2, 31)
			if root.left != None:
				leftRes = self.minDepth(root.left)
			rightRes = pow(2, 31)
			if root.right != None:
				rightRes = self.minDepth(root.right)
			return 1 + min(leftRes, rightRes)