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 ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, priority queues, disjoint set unions, binary ...

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.