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.
To agree to a demand or request
Fill in the blanks with the appropriate antonym of the word in Italic from the options given:
The expansive view stretched for miles, while t...
Choose the word opposite in meaning to the given word.
Plenitude
Laudable
Something that is about to happen
Select the most appropriate antonym of the given word.
Damage
Choose the correct synonym for the given word.
Fright
What is the synonym for the word "pedantic"?
Acrimony