Doubt regarding recursive case

#1

i am not able to understand the logic behind k-l-1 for subtree can u please help me out

#2

For the output nodes not lying in the subtree with the target node as the root, we must go through all ancestors. For every ancestor, we find its distance from target node, let the distance be d, now we go to other subtree (if target was found in left subtree, then we go to right subtree and vice versa) of the ancestor and find all nodes at k-d distance from the ancestor

here for the videos sake d == l+1
u can take it to be d so that the l+1 factor does not create a understading problem
read this for better understanding

#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.