Interview Question for Intern at Microsoft:

This problem is quite difficult:

void SearchSum(Tree head, int sum, ArrayList<Integer> sol, int level)
{
  if (head!=null)
  {
   sol.add(head.data);
  int aux=0;
   for(int i=sol.length;i>-1;i--)
    {
      aux+=sol[i];
     if(aux==sum)
        {
           printArray(aux,i,level);
        }
    List<Integer> l1=sol.Clone();
    List<Integer> l2=sol.Clone();
     SearchSum(head.left, sum, sol, level+1);
    SearchSum(head.right, sum,sol, level+1);
    }
  }
}

void printArray(ArrayList<Integer> aux,int i,int level)
{
 String sol="";
   for(int j=i;j<level;j++)
   {
     sol+=aux[j]+";";
   }
Console.WriteLine(sol);
}