@@ -0,0 +1,765 @@
+%22%22%22%0AGiven a binary tree, return all root-to-leaf paths.%0A%0AFor example, given the following binary tree: %0A   1%0A /   %5C%0A2     3%0A %5C%0A  5%0AAll root-to-leaf paths are: %0A%5B%221-%3E2-%3E5%22, %221-%3E3%22%5D%0A%22%22%22%0A%0Aclass TreeNode(object):%0A    def __init__(self, x):%0A         self.val = x%0A         self.left = None%0A         self.right = None%0A%0Aclass Solution(object):%0A    def binaryTreePaths(self, root):%0A        if not root:%0A            return %5B%5D%0A        if not root.left and not root.right:%0A            return %5Bstr(root.val)%5D%0A        if root.left:%0A            treepaths=%5Bstr(root.val)+'-%3E'+child for child in self.binaryTreePaths(root.left)%5D%0A        if root.right:%0A            treepaths+=%5Bstr(root.val)+'-%3E'+child for child in self.binaryTreePaths(root.right)%5D%0A        return treepaths%0A        %0A

Create LeetCode-BinaryTreePaths.py