- 1 class Solution:
- 2 # @param {TreeNode} root the root of the binary tree
- 3 # @return {List[str]} all root-to-leaf paths
- 4 def binaryTreePaths(self, root):
- 5 # Write your code here
- 6result = []
- 7 ifrootis None:
- 8 return result
- 9 self.dfs(root, result, [])
- 10 return result
- 11
- 12 def dfs(self, node, result, tmp):
- 13 tmp.append(str(node.val))
- 14 ifnode.leftisNoneandnode.rightis None:
- 15result.append('->'.join(tmp))
- 16 tmp.pop()
- 17 return
- 18
- 19 if node.left:
- 20 self.dfs(node.left, result, tmp);
- 21
- 22 if node.right:
- 23 self.dfs(node.right, result, tmp)
- 24
- 25tmp.pop()
来源: