CareerCup

:-O

is the question complete?if yes then plz someone explain it

I guess it as "Find the path and print it in a BST whose sum is S".......but it may be the trick of interviewer to check if you have mugged up the questions or not......:P

this question is as follows:-

given a binary tree and a value S, print the root to leaf node path, that if we take sum of all the elements on the path, it will give value S.
I was asked this question in Amazon interview. The question is damn easy. Use recursion.

Still don't get it... Show the sum of all nodes of BST??

public int Sum(Node root)
{
   return root.Data + Sum(root.Left) + Sum(root.Right);
}