Binary Tree Paths

Try to solve the Binary Tree Paths problem.

We'll cover the following

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

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.