257. Binary Tree Paths 二叉树路径

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

   1
 /   \
2     3
 \
  5

All root-to-leaf paths are:

["1->2->5", "1->3"]

1. # Definition for a binary tree node.
2. # class TreeNode(object):
3. # def __init__(self, x):
4. # self.val = x
5. # self.left = None
6. # self.right = None
8. class Solution(object):
9. def binaryTreePaths(self, root):
10. if not root:
11. return []
12. result = []
13. self.dfs(root, result, "")
14. return result
16. def dfs(self, node, result, string):
17. if not node.left and not node.right:
18. result.append(string + str(node.val))
19. if node.left:
20. self.dfs(node.left, result, string + str(node.val) + "->")
21. if node.right:
22. self.dfs(node.right, result, string + str(node.val) + "->")

null

转载于:https://www.cnblogs.com/xiejunzhao/p/a01c0c7c89ae8905dca777b29325a874.html