Description
给定一个二叉树,返回所有从根节点到叶子节点的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
输入:
1
/ \
2 3
\
5
输出: ["1->2->5", "1->3"]
解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-paths
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Solution
class Solution:
def binaryTreePaths(self
, root
: TreeNode
) -> List
[str]:
res
= []
def helper(root
, track
):
if not root
: return
track
.append
(root
.val
)
if not root
.left
and not root
.right
:
res
.append
(track
[:])
helper
(root
.left
, track
)
helper
(root
.right
, track
)
track
.pop
()
helper
(root
, [])
for i
in range(len(res
)):
res
[i
] = [str(e
) for e
in res
[i
]]
res
[i
] = '->'.join
(res
[i
])
return res