Handbook of Data Structures and Applications responds to the needs of data structure and algorithm researchers by providing a comprehensive survey of data structures of various types. Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-know classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. It next analyzes miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination applications of data structures.
The text starts with trees and graphs. Then goes on to heaps, priority queues and general purpose queues. And then to hash tables and search trees. The latter are shown to be importantly different from generic trees. Naturally, B and B* trees also come into the picture.
More complex structures that arise out of the multidimensional nature of data are also investigated.
The typical chapter can be a little terse if you have not encountered its ideas before. The book is best suited to someone also well versed in data structures, and who needs a solid reference manual.
TABLE OF CONTENT:
Part 1 - Fundamentals
Part 2 - Priority Queues
Part 3 - Dictionary Structures
Part 4 - Multidimensional and Spatial Structures
Part 5 - Miscellaneous Data Structures
Part 6 - Data Structures in Languages and Libraries
Part 7 - Applications
Password:knowfree.net
