This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures forsets 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. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic 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 INDICE: 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
- ISBN: 978-0-521-88037-4
- Editorial: Cambridge University
- Encuadernacion: Cartoné
- Páginas: 472
- Fecha Publicación: 08/09/2008
- Nº Volúmenes: 1
- Idioma: Inglés