FunctionRacerProblemsRace

Binary Tree Paths

EasyTreesPython, JavaScript, TypeScript, Java, C++

You are given the root of a binary tree. Return every path from the root down to a leaf as a string with the values joined by "->", like "1->2->5". List the paths in left-to-right order of their leaves. A single-node tree gives one path, just that value. An empty tree gives [].

Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.

Example 1

root [1,2,3,null,5]
returns ["1->2->5","1->3"]

Leaves 5 and 3: "1->2->5" and "1->3".

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Trees problems