257. Binary Tree Paths列印二叉樹路徑
阿新 • • 發佈:2019-02-19
# 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):
"""
:type root: TreeNode
:rtype: List[str]
"""
res = []
if root:
self.getPath(root,'',res)
return res
def getPath(self,node,line,res):
if not node.left and not node.right:
res.append(line+str(node.val))
if node.left:
s=line+str(node.val)+'->'
self.getPath(node.left,s,res)
if node.right:
s=line+str(node.val)+'->'
self.getPath(node.right,s,res)
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def binaryTreePaths(self, root):
"""
:type root: TreeNode
:rtype: List[str]
"""
res = []
if root:
self.getPath(root,'',res)
return res
def getPath(self,node,line,res):
if not node.left and not node.right:
res.append(line+str(node.val))
if node.left:
s=line+str(node.val)+'->'
self.getPath(node.left,s,res)
if node.right:
s=line+str(node.val)+'->'
self.getPath(node.right,s,res)