Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm?
(A) Queue
(B) Stack
(C) Tree
(D) Graph
Answer: (B)
Explanation: Since function calls are executed in Last In First Out order, stack is the data structure for converting recursive to iterative implementation.
Quiz of this Question
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!