Which data structure is best for recursion?
Which data structure is best for recursion? Many programming languages implement recursion by means of stacks. Generally, whenever a function (caller) calls another function (callee) or itself as callee, the caller function transfers execution control to the callee. Which data structure you will prefer if you want to apply recursive process for solving a particular problem? There are data-structures, such as trees, that are well-suited to recursive algorithms. There are even some programming languages with no concept of a loop — purely functional languages such as Haskell depend entirely on recursion for iterative problem solving . Which algorithm is used...