Stack

Question

Every recursive program uses strictly more stack space compared to its iterative equivalent.

This statement is false. Please explain with examples

Comments

It is totally dependent on the Implementation.

---

can you explain it more accurately?

Answer 1

My approach: Take inorder traversal of a binary tree. You'll need a custom stack if you want to implement the function with iterative version. On comparing this iterative version with recursive version of the inorder traversal, we find that both methods are using same number of stack frames. Recursive version is just easy and more intuitive.

Comments

Can iterative version can ever take more stack space than recursive counterpart?

---

No, if implemented properly.

---

@neeraj33negi

Kindly elaborate with an example..

Answer 2

How can iterative algorithm uses more space than it's equivalent recursive algorithm??? Even though both needs variable and program memory but recursive algorithm requires additional memory for stack.