Sum Root To Leaf Numbers is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers. For example,

/ \
2 3
  • The root-to-leaf path 1->2 represents the number 12.
  • The root-to-leaf path 1->3 represents the number 13.
  • Return the sum = 12 + 13 = 25.

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!