Binary Tree Paths is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree:

     1
   /   \
  2     3
   \
    5

All root-to-leaf paths are:

["1->2->5", "1->3"]

Implementation: Please check the main.js snippet for the solution. If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!