GeezerVison is showing github.com — AlgorithmNuggets/ProblemSolving/binaryTreePaths/bin.py at master · srixivas/AlgorithmNuggets

Expand file tree

bin.py

Copy path

More file actions

36 lines (29 loc) · 969 Bytes

Copy path

36 lines (29 loc) · 969 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

# Definition for a binary tree node.

# class TreeNode(object):

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

class Solution(object):

def binaryTreePaths(self, root):

"""

:type root: TreeNode

:rtype: List[str]

"""

def preOrder(node, paths):

if not node:

return

else:

if not node.left and not node.right:

result.append("->".join(paths+[str(node.val)]))

if node.left:

preOrder(node.left, paths+[str(node.val)])

if node.right:

preOrder(node.right, paths+[str(node.val)])

paths = []

result = []

if root and not root.left and not root.right:

return [str(root.val)]

preOrder(root, paths)

print result

return result