Data Structures (C Language Version)

Author: (USA) Horowitz et al.
Publisher:
Publish Date: 2006-07-01
Features: This book provides a comprehensive description and in-depth discussion of data structures implemented using ANSI C. It elaborates on stacks, queues, linked lists, and search structures, as well as advanced tree structures. The book effectively analyzes new data structures such as Fibonacci heaps, treap trees, red-black trees, 2-3 trees, 2-3-4 trees, binomial heaps, min-max heaps, and dual-ended heaps. It offers compiled and tested programs and algorithms for special forms of heap structures, including those used in dual-ended priority queues (e.g., min-max heaps and dual-ended heaps), as well as left-leaning trees, Fibonacci heaps, and binomial heaps. The book thoroughly explores the amortized complexity issue and analyzes the time complexity of most algorithms. It is suitable as a textbook for undergraduate and graduate students in computer science programs on algorithms and data structures (C language implementation) in higher education institutions, as well as a reference for self-study by enthusiasts of algorithms and data structures.