COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Recursive problems are implemented by
|
|
stack
|
|
|
queue
|
|
|
linked list
|
|
|
strings
|
Explanation:
Detailed explanation-1: -Recursion is implemented using stack because activation records are to be stored in LIFO order i.e. last in first out. An activation record of a function call contains three parts: first is arguments, return address and local variables of the function.
Detailed explanation-2: -Memory Allocation in Recursion. When a function is called, its memory is allocated on a stack.
There is 1 question to complete.