Tap here to switch tabs
Problem
Submissions

Problem: Binary Tree Paths

Binary Tree Paths asks you to return every path from a binary tree's root to its leaves, formatting each as node values joined by arrows. A leaf has no children.

Statement

Given the root of a binary tree, return all paths from the root to the leaf nodes in any order. Each path should be represented as a string of node values, separated by arrows (→), where a leaf is defined as a node with no children.

Constraints:

  • 1≤1\leq nodes ≤100\leq 100

  • −104≤-10^4\leq nodes.data ≤104\leq10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Binary Tree Paths

Binary Tree Paths asks you to return every path from a binary tree's root to its leaves, formatting each as node values joined by arrows. A leaf has no children.

Statement

Given the root of a binary tree, return all paths from the root to the leaf nodes in any order. Each path should be represented as a string of node values, separated by arrows (→), where a leaf is defined as a node with no children.

Constraints:

  • 1≤1\leq nodes ≤100\leq 100

  • −104≤-10^4\leq nodes.data ≤104\leq10^4