Data Structures and Algorithms in C++ 第四版

Chapter 1 presents the basic principles of object-oriented programming, an introduction to dynamic memory allocation and the use of pointers, and a rudimentary presentation of the Standard Template Library (STL). ■ Chapter 2 describes some methods used to assess the efficiency of algorithms. ■ Chapter 3 presents different types of linked lists with an emphasis on their implementation with pointers. ■ Chapter 4 presents stacks and queues and their applications. ■ Chapter 5 contains a detailed discussion of recursion. Different types of recursion are discussed, and a recursive call is dissected. ■ Chapter 6 discusses binary trees, including implementation, traversal, and search. Balanced trees are also included in this chapter. ■ Chapter 7 details more generalized trees such as tries, 2– 4 trees, and B-trees. ■ Chapter 8 presents graphs. Chapters 9–13 show different applications of data structures introduced in the previous chapters. They emphasize the data structure aspects of each topic under consideration. ■ Chapter 9 analyzes sorting in detail, and several elementary and nonelementary methods are presented. ............................................. ................................................. .....................................................