leetcode in python 257

最新推荐文章于 2024-07-19 06:05:36 发布

annalittlezhou

最新推荐文章于 2024-07-19 06:05:36 发布

阅读量337

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/annalittlezhou/article/details/79468705

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

All root-to-leaf paths are:

["1->2->5", "1->3"]

关键词：二叉树，节点类型

时间自由度：O（nlog2（n））

# 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 not root:return []
        self.result = []
        self.path(root,str(root.val))
        return self.result
    
    def path(self,node,s):
        if not (node.right or node.left):self.result.append(s)
        print self.result
        if node.left:self.path(node.left,s+'->'+str(node.left.val))
        print self.result
        if node.right:self.path(node.right,s+'->'+str(node.right.val))    
        print self.result