Find Path in BST

i code this out ,but not able to understand how recursion is working,very similar question


my code https://ide.geeksforgeeks.org/ICbXeV4eM8
problem is ,how can i assume that the answer will be in leftoutput only or rightoutput only?
i mean sometime we need to call for left and sometimes to the right ,how this is managed in recursion calls

Plz send your code by saving on coding blocks ide only.

lo mam aapka fav ide pe :stuck_out_tongue:

Shubham plz send the complete code and question also, Since I am not able to understand your querry.