Lintcode 480. Binary Tree Paths (Easy) (Python)

480. Binary Tree Paths

Description:

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

Example

Given the following binary tree:

1
/ \
2 3
\
5
All root-to-leaf paths are:

[
“1->2->5”,
“1->3”
]

Code:

"""
Definition of TreeNode:
class TreeNode:
    def __init__(self, val):
        self.val = val
        self.left, self.right = None, None
"""

class Solution:
    """
    @param root: the root of the binary tree
    @return: all root-to-leaf paths
    """
    def binaryTreePaths(self, root):
        # write your code here
        res = []
        if root == None:
            return res
        if root.left == None and root.right == None:
            return [str(root.val)]
        resl = self.binaryTreePaths(root.left)
        resr = self.binaryTreePaths(root.right)
        return [str(root.val)+'->'+i for i in resl]+[str(root.val)+'->'+i for i in resr]