Why Stack Is Used for Recursion?

Now Stack is a LIFO data structure i.e. ( Last In First Out) and hence it is used to implement recursion. The High level Programming languages, such as Pascal , C etc. that provides support for recursion use stack for book keeping. the return address (the address where the control has to return from the call).

Does recursion always use stack?

Explanation: Recursions are always managed by using stack. 3. Which of these will happen if recursive method does not have a base case? Explanation: If a recursive method does not have a base case then an infinite loop occurs which results in Stack Overflow.

Why does recursion use stack overflow?

The most-common cause of stack overflow is excessively deep or infinite recursion, in which a function calls itself so many times that the space needed to store the variables and information associated with each call is more than can fit on the stack. An example of infinite recursion in C.