Question

-For which of the given options is the stack implementation useful?

a- Radix search

b- Breadth first search

c- Recursion

d- None of the above

​

Answer 1

Answer:

Explanation: c. Recursion

Answer 2

Stack implementation is useful for understanding recursion.

Answer - Recursion (Option C)

Explanation:

• Stack is a linear data structure where its components are arranged in a straight line or stacked.
• Stack implementation is mostly applied for recursion of functions where one function can call itself, or another function or a totally another function until the farthest depth of a stack.
• Recursion is applied to simplify a problem by dividing it into subproblems.
• So in case of subproblems that are nested together, stack implementation can be applied to understand how the recursion is taking place.