Скачать или смотреть One Shot | Recursion | Recursive Tree & Calls | 12 Questions | Aditya Goyal

Welcome back to my channel!

In today's video, we'll explore Recursion, Recursive Trees, Stack Space, Recursive Call Flow, and Complexity.

Whether you're a beginner or looking to improve your knowledge, this video has something for everyone.

LinkedIn:   / aditya-goyal-252698221  
GitHub Repository: https://github.com/I-AdityaGoyal/DSA_...
DSA Sheet:https://docs.google.com/spreadsheets/...

Remember to subscribe to the channel and share this video with your friends interested in mastering DSA. Also, like this video and comment below with your thoughts or questions!

Timestamps:
00:00 - Intro: Ram Ram
01:02 - Flow
01:45 - Example: Print N to 1
02:04 - Iterative Way
02:52 - Separate Calls
10:08 - Why a Function Calling Itself?
14:28 - Recursion Dry Run
19:16 - Stack Overflow
20:36 - Recursive Tree
22:57 - Components of Recursive Function
24:10 - Recap
26:29 - Stairs Example
28:59 - Example: Name N Times
35:05 - Example: Ascending | Descending Order (1 to N)
47:10 - Example: Sum of N Numbers
48:56 - Functional Way
59:37 - Parameterized Way
01:07:10 - Reverse Array
01:16:36 - Time & Space Complexities of All Examples
01:18:53 - Recap
01:24:53 - Outro: Sita Ram
01:25:23 - Ques 1
01:48:52 - Ques 2
02:05:51 - Ques 3
02:31:05 - Ques 4
02:45:18 - Ques 5
03:17:23 - Ques 6
03:43:54 - Ques 7
04:14:50 - Ques 8
04:33:38 - Ques 9
04:47:11 - Ques 10
05:03:50 - Ques 11
05:18:48 - Ques 12