write down the code in C++

Given a binary tree and X, write an algorithm to print any path starting from root so that sum of all the nodes in path equals to a given number. If there is no such path print "No Path" Sample Input 8 21 Sample Output | 8 3 64 3 (10) 1 6 (14) 4. 7 (13)