LeetCode-Solutions/Python/binary-tree-paths.py at master · pythonpeixun/LeetCode-Solutions · GitHub

31 lines (25 loc) · 813 Bytes

# Time: O(n * h)

# Space: O(h)

class Solution(object):

# @param {TreeNode} root

# @return {string[]}

def binaryTreePaths(self, root):

result, path = [], []

self.binaryTreePathsRecu(root, path, result)

return result

def binaryTreePathsRecu(self, node, path, result):

if node is None:

return

if node.left is node.right is None:

ans = ""

for n in path:

ans += str(n.val) + "->"

result.append(ans + str(node.val))

if node.left:

path.append(node)

self.binaryTreePathsRecu(node.left, path, result)

path.pop()

if node.right:

path.append(node)

self.binaryTreePathsRecu(node.right, path, result)

path.pop()

Expand file tree