@@ -0,0 +1,688 @@
+# Definition for a  binary tree node%0A# class TreeNode:%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.left = None%0A#         self.right = None%0A%0A%0Aclass Solution:%0A    # @param root, a tree node%0A    # @return an integer%0A%0A    def minDepth(self, root):%0A        if root is None:%0A            return 0%0A        q = collections.deque(%5B(root, 1)%5D)%0A        while len(q) != 0:%0A            p = q.popleft()%0A            flag = True%0A            if p%5B0%5D.left:%0A                q.append((p%5B0%5D.left, p%5B1%5D+1))%0A                flag = False%0A            if p%5B0%5D.right:%0A                q.append((p%5B0%5D.right, p%5B1%5D+1))%0A                flag = False%0A            if flag:%0A                return p%5B1%5D%0A

add solution for Minimum Depth of Binary Tree