Recursion Example of a Function with Multiple Recursive Calls

This video includes two examples of recursive functions that have multiple recursive calls. I trace the execution of these two functions using a call tree diagram. One function produces output that is a post-order traversal of the call tree, and the other one produces output that is a pre-order traversal of the call tree. I finish the video by discussing the time complexity of the functions.

[balledachandrahas]

This is the kinda explanation I am looking for the entire day. Thank you so much for mind-blowing explanation.

[bharathKumar-orgd]

Greate explnantion with good patience, i never find any lecture in youtube, everyone is expalining fact and fib and skipping, but you have doen great job

[abdullahbukhari]

Thank You so much Mam! This helped me immensely in understanding the logic behind the process. I'm surprised at the relatively low number of views, coz' this is a million dollar explanation.

[aathrayeeshankaranarayanan]

Hey, what if in the fun function we replace the cout line with a return to the main function or a program exit statement. What would happen to the stack then? Will it still run fun(n-2) and fun(n-3)?

[Druid-mmzq]

Recommended to everyone!!! Best explanation I have ever found, how the recursive functions actually works. Great job and thank you!

[sarthakpatel]

Thanks a lot really cleared my concept and I am subscribing you....

[TechNikky]

Thankyou for such good explanation, love your voice btw

[nocturnal_wanderer]

Given a set
of coin values coins = {c1, c2, ..., ck} and a target sum of money n, our task is to
form the sum n using as few coins as possible. Solution function:
solve(x) = min(solve(x−1)+1,
solve(x−3)+1,
solve(x−4)+1)
Can you explain dry run for this one, please?

[theVSORIGINALs]

first time i saw recursion tutorial without factorial and fibonaci thanks

[LeadtheFuture]

Thank you so much for informative video.I am a computer programmer student and i learned subject like you showed us.I was studying merge sort code for C i tried to understand codes with this logic but some mistakes and length of recursion tree cause me to confused.Then i asked chatgpt 2 times and i got 2 different answer. So all questions in my mind are gone with your video.

[alisabir]

i have one query searching it for consecutive 3 days please please correct if anyone understand like when we move right then we hit 3 fun(n-2) but 3 isn't the base case then we again have to iterate fun(n-2) which in case print 1 and then fun(n-3) and then fun(n-1) we have to follow a sequence but as soon as we hit 3 from five we again move back to (n-1) and not following the sequence why please anyone tell me pleasee

[amanpalrayat]

Awesome explanation, I love the way to explain this concept :) Keep it up the Good work

[anshvashisht]

funny how you name the function.
now let's do more fun 13:07
ps:- amazing explanation.

[uttamrohilla]

Amazing explanation 👍👍, I made recursion clear to me only through this video, thank you🙏👍👍, keep making this kind of videos

[martinquintero]

Thank you so much for helping me understand multiple calls.

[sandeepmk]

Thanks Gina for great explanation. Can you do Leet code recursive solution videos

[mdnehal]

thank you for explanation i am too confusing in recursion tree now i am able to draw the tree of function call once again thank you soo much!

[pryansh_]

Explained with lot of patience n thoroughly
thank you a lot you hv my mad respect n u hv a beautiful voice too 😄

[momengamer]

i'm not used to write comments on youtube, but your explanation is great thank you u👍

[subhojitsarkar]

fun more fun looks like more depression to me . i really like the explanation though