Data Structures and Algorithms (Java Language Description)

Author: Deng Junhui
Publisher:
Publish Date: 2006-02-01
Features: The author of this book strives to break the conventional patterns of such textbooks over the years and makes bold attempts in many aspects. In terms of format, the author, based on years of teaching experience, has reorganized and arranged the knowledge points, with many treatment methods standing out among similar textbooks, aiming to guide readers to a higher level and help them form a macro understanding of data structures. In terms of content, this book does not cover all types of data structures comprehensively but carefully selects necessary knowledge points and skill requirements according to the CC2001 standard. Through systematic classification and heuristic explanations, it bridges the gap between basic and advanced data structures. In terms of algorithms, this book not only emphasizes the grasp of fundamental concepts like complexity but also introduces various analysis methods for algorithm complexity, especially advanced techniques like amortized analysis. Moreover, all data structures still form a complete system, helping readers develop an awareness of practical applications and master the basic skills to construct real-world applications. This book fully demonstrates the application of object-oriented technology in modern data structure theory, widely adopting techniques such as abstraction, encapsulation, and inheritance. It introduces both basic data structures, including stacks, queues, vectors, and list structures, as well as several advanced data structures, such as priority queue structures, mapping and dictionary structures, and search tree structures. It also introduces the application, implementation, and analysis methods of algorithms through specific problems, covering algorithms such as the generation and high-speed algorithms of heap structures, Huffman encoding tree algorithms, the generation, insertion, and deletion algorithms of balanced search trees, and focuses on the KMP and BM algorithms for string matching. This book also unifies various graph algorithms through traversal algorithm frameworks and implements them based on traversal algorithm templates, standing out among similar textbooks. The book is richly illustrated and progresses step by step. All the code is accompanied by detailed yet concise comments. Additionally, it intersperses numerous questions related to the specific content of each section to stimulate readers' curiosity and cultivate good self-learning habits and abilities. This book is suitable as a textbook or reference book for undergraduate students in computer science.