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.
What is ‘Jallikattu’?
Which of the following served its national observer as tennis in 2018?
Which one is the incorrect statement about ‘SEBI SCORES’?
i. It is SEBI Complaints Redress System.
i...
What is the percentage of GST charged on hotel rooms?
Which of the following words was added to the Preamble of the Constitution of India by 42nd amendment of the Constitution?
During the rule of which of the following dynasties did Timur or Tamerlane invade India in 1398 AD?
Dosmoche is a Buddhist festival celebrated in which Indian state?
What does El Niño refer to?
In the Union budget 2018-19, Operation Green with an allocation of Rs 500 crore was introduced under the Ministry of Food Processing Industries (MoFPI...
Husk of a coconut is made of ______ tissue.