About code of this problem

#1

can you give me program for this question

#2

we can’t give you code directly for any program
first try at your own and
if find any difficulty i will help you

#3

Q1: i dont understand K-L-1. Q2: WHY L-1, Q3: WHAT IS L ? AND Q4: WHY -1 ?

sketch0
sketch0681×584 35.4 KB

Q5: can u point out L,L-1 using this example. Take target=7 and k=4
Q6: Can u explain this " From root , say the target node is at depth 3 in the left branch. It means that any nodes that are distance K - 3 in the right branch should be added to the answer. " ?