About the book: Data Structures, Algorithms And Applications in C++ contains a comprehensive overview of the subject of data structures and algorithms using the C++ programming language. In the beginning of this book, the author tells the readers that they must have a sound understanding of C++ before they attempt to learn data structures and methods for designing algorithms. The first four chapters of this book are intended to provide the readers with a revision of important skills needed for digging deeper into this subject. Some of these concepts include recursion, exception handling, function overloading, testing, debugging, asymptotic notation, time complexity, and practical complexities.

This book is divided into three parts, Preliminaries, Data Structures, and Algorithm-Design Methods. There are 24 chapters in total, and some of them include Balanced Search Trees, Graphs, Dynamic Programming, The Greedy Method, Branch and Bound (On The Web), Skip Lists and Hashing, Linear Lists-Array Representation, Binary and Other Trees, Performance Analysis, Performance Measurement, Arrays and Matrices, and Stacks.

The author provides the readers with numerous examples, which help them understand concepts better. Additionally, exercises have also been provided at the end of the chapter to test the understanding of the reader effectively. Some of the crucial concepts covered include Kruskal’s algorithm, polynomial evaluation, Fibonacci numbers, and binary search.