CareerCup

void PrintPath(node *root,int N,int a[],int currentIndx)
{
if(!root || N<0)
return ;

a[indx]=root->data;

if(N- root->data==0)
Print(a,currnetIndx);

PrintPath(root->left,N-root->data,a,currnetIndx+1);

PrintPath(root->right,N-root->data,a,currnetIndx+1);

}

void SumPaths(node *ptr, int path[], int pathlen, int count)
{
if(ptr==NULL)
return;
count = count- (ptr->data);
path[pathlen]=ptr->data;
pathlen++;
if (count == 0)
PrintPath(path,pathlen);
else
{
SumPaths(ptr->left,path,pathlen,count);
SumPaths(ptr->right,path,pathlen,count);
}
}

@y2km11 let us know your answers for the questions that you have posted here. That would help us. Thanks in advance.