[algogeeks] Tree - sum problem

[Amitesh Singh]

Given a binary search tree and a target value, find all the paths (if there
exists more than one) which sum up to the target value. It can be any path
in the tree. It doesn't have to be from the root.
-- 
Amitesh

--