Question

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Comments

Stack  is a very good example for this case.

---

What is the reasoning of it @Manikandan

---

Probably, you would see a stack. A recursive algorithm works by calling itself each time with different data. So, to simulate that without actual recursion,you would need to track the changing data on some kind of stack. This would allow the data to be processed in a last-in-first-out order, which is how recursion works

Answer 1

A recursive algorithm works by calling itself, each time with different data. So, to simulate that without actual recursion, you would need to track the changing data on some kind of stack. This would allow the data to be processed in a last-in-first-out order, which is how recursion works.

Comments

I think u misread the question, question is about which datastructure...