Algorithms for managing data structures sometimes involve recursion. With recursion, an algorithm calls itself, which means it repeats its own processes as part of a looping structure, with each ...

Examines several design issues, including selection of data structures based on operations to be optimized, algorithm encapsulation using classes and templates, and how and when to use recursion.

Drawing on multileveled models described in the literature, the present study (a) proposed a definition of a second level of recursive structure involved in perspective-taking tasks, (b) ...