首页 > 代码库 > 257. Binary Tree Paths 二叉树路径
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"]
# 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):
if not root:
return []
result = []
self.dfs(root, result, "")
return result
def dfs(self, node, result, string):
if not node.left and not node.right:
result.append(string + str(node.val))
if node.left:
self.dfs(node.left, result, string + str(node.val) + "->")
if node.right:
self.dfs(node.right, result, string + str(node.val) + "->")
null
257. Binary Tree Paths 二叉树路径
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。