Register

Stack

1,451 views
1 1 vote
Every recursive program uses strictly more stack space compared to its iterative equivalent.

This statement is false. Please explain with examples

2 Answers

1 1 vote
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.
0 0 votes
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.
Voting & Accepting an answer helps improve the community
← Previous · avl tree-AAI examNext → · Self Doubt
← Previous in category · Aai it 2018Next in category → · Doubt : ACE OTS
Position:
Show:

Related questions

0 0 votes
2 2 answers
529
529 views
ARUN_YADAV 1 asked Jan 20
529 views
Stack implementation
2 2 votes
2 2 answers
2.4k
2.4k views
Gurdeep Saini asked Jan 2, 2019
2,391 views
Stack implementation by using queue
true/false ?) if stack is implemented as a array,all operation push ,pop ,is emptystack(),delete stack() can be performed in constant time.)if stack is implemented as a l...
2 2 votes
0 0 answers
844
844 views
CHïntän ÞäTël asked Dec 7, 2018
844 views
MadeEasy Subject Test 2019: Programming & DS - Stack
I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2…TRY AND CORRECT IF I M WRON...
1 1 vote
1 1 answer
2.5k
2.5k views
radha gogia asked Jul 24, 2018
2,470 views
What is the total number of distinct words that can be formed out of n letters using below operations with stack ?
Suppose one character at a time comes as an input from a string of letters . There is an option either to 1) print the incoming letter or to 2) put the incoming letter on...