Start learning 50% faster. Sign in now
A stack is the most suitable data structure for implementing recursion. This is because recursive calls need to store the state of the current function execution before jumping into the next function call. Stacks follow the Last In, First Out (LIFO) principle, which perfectly suits the recursive function call structure. Why Other Options are Wrong: b) A queue follows First In, First Out (FIFO), which doesn’t support the nature of recursion. c) Linked lists can be used for dynamic memory but are not suitable for managing function calls in recursion. d) Arrays have a fixed size and do not inherently support LIFO behavior. e) Hash tables are for storing key-value pairs and have no role in recursion.
Height-wise, who among the following lies between Sohan and Rahul?
Four of the following five are alike in a certain way and hence they form a group. Which one of the following does not belong to that group?
What is the age of one who likes Apple?
Which of the following income does Esha have
Who among the following have bought Van heusen shirt?
How many persons live between V and W?
Who among the following belongs to Uttar pradesh?
If Garima is related to January, Chaman is related to April. In the similar way, Ayushi is related to?
Which of the following box is wrapped with Pink paper?