257. Binary Tree Paths [Easy] DFS

最新推荐文章于 2023-07-29 01:49:56 发布

木木歹朱

最新推荐文章于 2023-07-29 01:49:56 发布

阅读量63

点赞数

本文链接：https://blog.csdn.net/qq_35319215/article/details/96921175

版权

257. Binary Tree Paths

# 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]
        """
        if root == None:
            return []
        res = []
        trace = []
        self.DFS(root, res, trace)
        return res
    def DFS(self, root, res, trace):
        trace.append(str(root.val))
        if root.left == None and root.right == None:
            res.append('->'.join(trace))
            trace.pop()
            return
        if root.left:
            self.DFS(root.left, res, trace)
        if root.right:
            self.DFS(root.right, res, trace)
        trace.pop()