"root-to-leaf path" is defined to be a sequence of nodes in a tree starting with the root node and proceeding downward to a leaf. An empty tree contains no root-to-leaf paths.
My goal, given a binary tree and a sum, is to return true if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Returning false if no such path can be found.
There could possibly be more than one root-to-leaf paths for each sum. Find all the root-to-leaf paths that give the required sum.
I have attached a document that can explain what I am trying to do, in detail.
Attachment:- treeDoc.zip