LeetCode(力扣)257. 二叉树的所有路径Python

板砖大的砖头

已于 2023-08-17 21:41:20 修改

阅读量198

点赞数

分类专栏： Python刷题记录文章标签： leetcode python 算法 linux 职场和发展

于 2023-08-17 21:23:45 首次发布

本文链接：https://blog.csdn.net/qq_44953660/article/details/132351016

版权

Python刷题记录专栏收录该内容

54 篇文章 0 订阅

订阅专栏

LeetCode257. 二叉树的所有路径

- 题目链接
- 代码

题目链接

https://leetcode.cn/problems/binary-tree-paths/
在这里插入图片描述

代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def traversal(self, node, result, path):
        path.append(node.val)
        if not node.left and not node.right:
            spath = '->'.join(map(str, path))
            result.append(spath)
            return
        if node.left:
            self.traversal(node.left, result, path)
            path.pop()
        if node.right:
            self.traversal(node.right, result, path)
            path.pop()

    def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
        result = []
        path = []
        if not root:
            return None
        self.traversal(root, result, path)
        return result

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def traversal(self, node, result, path):
        path += str(node.val)
        if not node.left and not node.right:
            result.append(path)
            return
        if node.left:
            self.traversal(node.left, result, path + '->')
        if node.right:
            self.traversal(node.right, result, path + '->')

    def binaryTreePaths(self, root: Optional[TreeNode]) -> List[str]:
        result = []
        path = ''
        if not root:
            return None
        self.traversal(root, result, path)
        return result