Advanced Data Structures
Advanced Data Structures
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text examines efficient ways to search and update sets of numbers, intervals, or strings by various data structures, such as search trees, structures for sets of intervals or piece-wise constant functions, orthogonal range search structures, heaps, union-find structures, dynamization and persistence of structures, structures for strings, and hash tables. This is the first volume to show data structures as a crucial algorithmic topic, rather than relegating them as trivial material used to illustrate object-oriented programming methodology, filling a void in the ever-increasing computer science market. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text. topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
- This is the only graduate-level textbook on data structures
- Contains discussion of numerous structures with their analysis, code examples, implementation details, and in most cases a complete implementation on author homepage
- Contains detailed history for each structure with more than 500 references
Reviews & endorsements
'I think this book is well suited as a main or supplemental text in a graduate-level data structures course, not to mention an invaluable desk reference for those interested in implementing the advance structures outlined in this book. This book was a joy to review, and deserves a place on my bookshelf.' SIGACT News
'It can be briefly said that the reader will be dealing with an illustration, diagram, and code packed book, that will do it's best not to confuse but to very well explain one of the toughest computer science subjects, and he will be pleasantly surprised to learn many new-age data structures.' Igor Gvero, Software Engineering Notes
Product details
May 2019Paperback
9781108735513
472 pages
230 × 152 × 24 mm
1.1kg
Available
Table of Contents
- 1. Elementary structures
- 2. Search types
- 3. Balanced search trees
- 4. Tree structures for sets of intervals
- 5. Heaps
- 6. Union-find and related structures
- 7. Data structure transformations
- 8. Data structures for strings
- 9. Hash tables
- 10. Appendix.
