Advanced Data Structures


Advanced Data Structures

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.


 Reviews:

"Advanced Data Structures is a very well-written resource on data structures. The book is compact without sacrificing clarity and rigor... the writing is clear and succinct enough that readers with an interest in the subject will be rewarded with an enjoyable tour through the mathematics and implementation of advanced data structure design. This book was a joy to review, and deserves a place on my bookshelf."
Richard Jankowski, 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

Loading...