Data Structures Question:
What is the data structures used to perform recursion?
Answer:
Stack. Because of its LIFO (Last In First Out) property it remembers its caller, so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.
| Previous Question | Next Question |
| If you are using C language to implement the heterogeneous linked list, what pointer type will you use? | What are the methods available in storing sequential files ? |