At 11:34, The Instructor Said that after Allotting NULL there, It Comes back to root 4. How?? And after that, How is it getting Implemented on the right?? How does the Program Know that 4 is the root element to get back to after returning NULL? After returning NULL, I guess the Program gets Terminated Right?
At 11:34. How Does the Program Execute to implement the root on the right?
@JaveedYara i’d suggest you to draw the recursion stack and try to dry run the code one time yourself. I’ll be happy to assist you if you are stuck anywhere. It is all possible to recursive calls and stack.
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.