CareerCup

Stack

LinkedList, because it's ordered container object.

linked list

Stack

Recursion actually needs to switch/restore back the states correctly. This restoration can happen effectively through pointers as they are address-based.

Hence, linked lists are preferred.

Linklist

for recursion only and only STACK

I browsed through some web resources and found stack to be most successful but can't find reason behind it. Can anyone explain?

I didn't understand the "best". But the stack is must have datas structure for recursion.

STACK

stack, it is first in, last out

Of those options, only the queue is fundamentally wrong.
However, none of the other options are particularly good.
A better option would be a tree, as the recursion might require many evaluations at each level, and a tree will be more flexible for that, and also allow parallelisation if the problem is suitable..

As this is an interview question, going beyond the presented options is probably not a bad thing.

Suppose we have three functions in recursion. For example. f1,f2, and f3.
f1 {
f2{
f3{
}
}
}

So complier should store f1 , f2 in such way that our program correctly jumb back to f2 after executing f3. And we know STACK works as "Last in First out" so f3 goes last and comes first according to concept. This what I can suggest here.

It is stack because a LIFO data structure.

i think its is link list becoz link list have next & previous node to track the data recursively.

i think its is link list becoz link list have next & previous node to track the data recursively.

Stack for sure

Stacks are more suitable for recursion..

jnfgkjnf

hi ,

ans : linked list ,because we can insert or delete etc, can do at any address location. in case of array ,stack and queue . we have to traverse , it takes more time.

hi ,

ans : linked list ,because we can insert or delete etc, can do at any address location. in case of array ,stack and queue . we have to traverse , it takes more time.

hi ,

ans : linked list ,because we can insert or delete etc, can do at any address location. in case of array ,stack and queue . we have to traverse , it takes more time.

hi ,

ans : linked list ,because we can insert or delete etc, can do at any address location. in case of array ,stack and queue . we have to traverse , it takes more time.

the concept of stack is necessary,but the successful implementation of the stack using linked list can make it much better through the top and head pointers the push,pop,peek and empty can be provided in O(1) that to with pointer access it is made fast.So considering recursion the idea of stack is important but the implementation is made via the list for maintaining the states.

Hi, Stack Prints LIFO order. And recursion also works in the same principle. So, only stack best suits for it.Actually Linked list, uses the concept of recursion, doesn't mean the best example for recursion.