Anything which is possible to solve using stack; it also can be solved using recursion. Since, system itself builds call stack when recursion is used. However, recursion is better for time complexity.

From function calls to memory frames — here’s why every recursive process depends on the stack (and what happens behind the scenes). Introduction: What Really Happens When You Call a Function? Most of ...

Stack memory is dominated by function call overhead (return addresses, saved registers), not data size or boxing approach. Modern compilers optimize away most theoretical differences.

Each time a function is called, the code for the function, as well as space for function arguments and return values, is pushed onto the top of the call stack. When the function finishes execution, ...

This Q&A is part of a weekly series of posts highlighting common questions encountered by technophiles and answered by users at Stack Exchange, a free, community-powered network of 100+ Q&A sites.