@@ -0,0 +1,684 @@
+# http://www.geeksforgeeks.org/find-minimum-depth-of-a-binary-tree/%0A%0Aclass Node:%0A    def __init__(self, value):%0A        self.value = value%0A        self.left = None%0A        self.right = None%0A%0A%0Adef solution(root):%0A    if not root:%0A        return 0%0A%0A    if not root.left:%0A        return solution(root.right) + 1%0A    if not root.right:%0A        return solution(root.left) + 1%0A%0A    return min(solution(root.left), solution(root.right)) + 1%0A%0A%0Aif __name__ == '__main__':%0A    root = Node(1)%0A    root.left = Node(2)%0A    root.right = Node(3)%0A%0A    root.left.left = Node(4)%0A    root.left.right = Node(5)%0A%0A    root.right.left = Node(6)%0A    root.right.left.left = Node(7)%0A%0A    print(solution(root))%0A

add find min depth