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.
The first book to show data structures as a crucial algorithmic topic, not trivial material to illustrate object-orientation.
Peter Brass received a PhD in mathematics at the Technical University of Braunschweig, Germany. He is an associate professor at the City College of New York in the Department of Computer Science and a former Heisenberg Research Fellow at the Free University of Berlin.
'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
 |
Ask a Question About this Product More... |
|
