Improved data structures. Brass P.

The book provides a comprehensive analysis of the ideas and details of the implementation of data structures as the most important component of applied algorithms. Not only effective ways to implement operations on many numbers, intervals or lines are considered in the form of various search structures of data-trees, many intervals, pieces of powerful functions, rectangular areas, non-overshooting, heaps, hash, but also dynamization and persistence (maintainability ) structures.

This is the first book that considers data structures not just as an auxiliary material to illustrate the methodology of object-oriented programming, but as a key issue of algorithm development.

numerous examples of code in the language of C and more than 500 links to primary sources make this book exclusively valuable.