Learn By Category
Data Structure is a method of collecting and organizing data in a way that we can perform operations on these data in effective way; it is about rendering data elements in terms of some relationship, for better organization and storage. In general, a data structure is a kind of higher-level instruction in a virtual machine: when an algorithm needs to execute some operations many times, it is reasonable to identify what exactly the needed operations are and how they can be realized in the most efficient way. This is the basic question of data structures: given a set of operations whose intended behavior is known, how should we realize that behavior? We study data structures so that we can learn to write more efficient programs. But why must programs be efficient when new computers are faster every year? The reason is that our ambitions grow with our capabilities. Instead of rendering efficiency needs obsolete, the modern revolution in computing power and storage capability merely raises the efficiency stakes as we computerize more complex tasks.
This book entitled “Advanced Data Structures” covers innovative techniques and easy-to-use text on data structures and algorithms valuable for undergraduates in computer science and information science. It covers the fundamental concepts of algorithms and most of the important data structures as well as the concept of interface design with examples and diagrams. This book proposes efficient ways to realize query and latest 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. This is intended to show data structures as a crucial algorithmic topic rather than relegating data structures to trivial material used to illustrate object-oriented programming methodology.
