Available question text
Return all root-to-leaf paths of a binary tree as strings like "1->2->5"; this requires a simple DFS/backtracking traversal to build each path from root to leaf.
Related questions
Continue with questions that share topics or the same question type.
- Make Costs of Paths Equal in a Binary Tree
Coding
- Pseudo-Palindromic Paths in a Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Bloomberg
Leetcode 257. Binary Tree Paths
Reported Mar 15, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceJustworks
Leetcode 257. Binary Tree Paths
Reported Jul 22, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source