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. Reviews There are no reviews yet. Be the first to review “Advanced Data Structures” Cancel replyYour email address will not be published. Required fields are marked *Your rating * Rate… Perfect Good Average Not that bad Very poor Your review *Name * Email * Save my name, email, and website in this browser for the next time I comment.
