Advanced Data Structures

by Peter Brass

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.

Genres: Computer Science, Algorithms, Programming, Software, Textbooks

474 pages, Hardcover

First published September 8, 2008

Reviews

[Tantrik · Rating 5 out of 5]

This book really has advanced data structures implementation in c. This not only explains data structures and their implementations but also explores multiple implementations of the same structure for advanced use cases.

For example we all know we can create stack in c with an array. But that might cause some problems in real worlds scenarios.
- You won't be able to use that stack more than once.
- The heap needs to allocate memory again if we need to go beyond the defined size.

Definitely pair it with "The algorithm design manual", So that you might learn how to solve real world problems with the data structure you are implmenting.