Please help in the ques

#1
#2

Hi… so all u have to do is print all paths from root node to any leaf node… so what u can do is maintain a vector which stores the nodes in current path and when ever u encounter a leaf node u store that path and try exploring other paths.
u can refer this https://ide.codingblocks.com/s/590857
if u still have any doubts msg back here…

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.