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. This Book Examines Efficient Ways To Realize Query And Update Operations On Sets Of Numbers, Intervals, Or Strings By Various Data Structures, Including Search Trees, Structures For Sets Of Intervals Or Piecewise 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.–jacket. Elementary Structures — Search Trees — Balanced Search Trees — Tree Structures For Sets Of Intervals — Heaps — Union-find And Related Structures — Data Structure Transformations — Data Structures For Strings — Hash Tables. Peter Brass. Includes Bibliographical References (p. 415-440) And Indexes. \”Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. This book examines efficient ways to realize query and update operations on sets of numbers, intervals, or strings by various data structures, including search trees, structures for sets of intervals or piecewise 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…