Data Structures - (C Language Version)

Author: Horowitz
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, splay trees, red-black trees, 2-3 trees, 2-3-4 trees, binomial heaps, min-max heaps, and double-ended heaps. It offers compiled and tested programs and algorithms for special forms of heap structures, such as those used in double-ended priority queues (min-max heaps and double-ended heaps), as well as left-leaning trees, Fibonacci heaps, and binomial heaps. The book thoroughly explores the concept of amortized complexity and analyzes the time complexity of most algorithms. This book is suitable as a textbook for undergraduate and graduate students in computer science programs on algorithms and data structures (C language implementation) in universities and colleges, as well as for self-study reference by enthusiasts of algorithms and data structures.