How can I print all paths in a binary tree that sum up to a particular value (path need not start at root of tree)?
You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum to a given value. The path does not need to start or end at the root or a leaf?