Skip to content

Practice Binary Tree Paths

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#257
LeetCode Problem

Binary Tree Paths

StringBacktrackingTreeDepth-First SearchBinary Tree

Problem Statement

Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children.

Source: Binary Tree Paths on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
root = [1,2,3,null,5]
Output
["1->2->5","1->3"]

# Example 2

Input
root = [1]
Output
["1"]

Constraints

The number of nodes in the tree is in the range [1, 100].
-100 <= Node.val <= 100

Related LeetCode Problems

Practice more problems similar to Binary Tree Paths.

17 Letter Combinations of a Phone Number Medium22 Generate Parentheses Medium3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium
← Previous Valid AnagramNext → Add Digits

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free