Run-Time Stack-Binding Time-Recursive case-Base case

Question

Elucidate the terms Run-Time Stack, Binding Time, Recursive case, Base case and Tail Recursion?

Answer 1

Base case : A case in recursion, in that the answer is recognized when the termination for a recursive condition is to un-wind back.

Recursive Case : A case which returns to answer which is closer.

Run-time Stack : A run time stack employed for saving frame stack of a function when every recursion or every call takes place.

Tail Recursion : It is a situation where a single recursive call is consisted by the function, and it is final statement to be implemented. It can be replaced by iteration.