[leetCode By Python]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.

代码＋调试：

class TreeNode:
    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 self.minDepth(root.right)+1
        if root.right==None and root.left!=None:
            return self.minDepth(root.left)+1
        return min( self.minDepth( root.left ), self.minDepth( root.right ) ) + 1

if __name__ == '__main__':  
    l1_1 = TreeNode(1)  
    l1_2 = TreeNode(2)  
    l1_3 = TreeNode(3)  
    l1_4 = TreeNode(4) 
    l1_5 = TreeNode(5) 
    l1_6 = TreeNode(6) 
    
    l1_1.left = l1_2  
    l1_1.right = l1_3 
    l1_2.left = l1_4
    l1_2.right = l1_5
    l1_4.left = l1_6 
  
    l3 = Solution().minDepth(l1_1)  
    print l3