LC-0257 Easy LeetCode

257. Binary Tree Paths

String Backtracking Tree Depth-First Search Binary Tree

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 66% Topics: String, Backtracking, Tree, Depth-First Search, Binary Tree

Reading material

Strings 12 min Backtracking 14 min Trees & Traversals 18 min

Reference solution (spoiler · python)

# Time:  O(n * h)
# Space: O(h)

class Solution(object):
    # @param {TreeNode} root
    # @return {string[]}
    def binaryTreePaths(self, root):
        result, path = [], []
        self.binaryTreePathsRecu(root, path, result)
        return result

    def binaryTreePathsRecu(self, node, path, result):
        if node is None:
            return

        if node.left is node.right is None:
            ans = ""
            for n in path:
                ans += str(n.val) + "->"
            result.append(ans + str(node.val))

        if node.left:
            path.append(node)
            self.binaryTreePathsRecu(node.left, path, result)
            path.pop()

        if node.right:
            path.append(node)
            self.binaryTreePathsRecu(node.right, path, result)
            path.pop()

Solution from kamyu104/LeetCode-Solutions · MIT