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.
What are the prerequisites for declaring any area as a 'Scheduled Area' under the Fifth Schedule of the Constitution of India?
1. Preponderanc...
Which of the following writs is issued to prevent a person from holding public office from doing any work to which he is not entitled?
Cobalamin is the scientific name of which of the following vitamins?
What is the tenure of the Sustainability-linked bonds issued by Mindspace Business Parks REIT?
Talisman Sabre – 23 is a
In which year was the first Cricket World Cup been hosted by India ?
Which article of the Indian Constitution guarantees the right to equality before the law?
According to the The Right to Education Act, what is the minimum age for a child to be in Grade-I (Class 1)?
On 1 January 2020, ISRO Chief K Sivan announced to establish India's second spaceport for launching small satellites in the state of:
Kalamandalam Ramankutty Nair received the Sangeet Natak Akademi Fellowship for his contribution to Kathkali in which of the following years?
