Advanced data structures
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 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. 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
1 online resource (xvi, 456 pages) : illustrations
9780511438202, 9780511433887, 9780521880374, 9780511436079, 9780511800191, 9780511437533, 0511438206, 0511433883, 0521880378, 0511436076, 0511800193, 0511437536
312435417
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
www.survey.bris.ac.uk We have trial access to this e-book until 9/7/2012 through our Cambridge Books Online trial of over 12,000 titles. Please tell us if you would like to recommend continued access to it
