Important Coding Interview Concept | Parts of a Recursive Function #shorts #datastructures

Key Takeaways

we want to model recursion as a tree recursion is when a function calls itself and what a recursive function needs is it needs two things it needs a base case where the recursion will stop the base case must be wide enough of a net to catch all types of input that are being converged to it by the recursive case the recursive case is going to reduce the size of the problem at every single step of the algorithm you need a base case and a recursive case recursive case Narrows down the input or the state of the overall algorithm to the base case what we can put here is a tree so that we can imagine this for a second as I was saying before recursion can be visualized as a tree and the nodes are calls the nodes are calls themselves and the edges in this tree are the relationships between the calls