Data structure

Author: Wang Qingrui
Publisher:
Publish Date: 1998-11-16
Features: This book discusses the fundamental theories of data structures from the perspectives of programming and algorithm design and analysis. It includes nine chapters: Introduction, Linear Lists, Linked Lists, Matrices and Hash Tables, Trees, Graphs, Sorting, Files, and Basic Methods of Algorithm Design. The first five chapters follow the common search, insert, and delete operations on datasets, elaborating on the characteristics, storage representations, operation algorithms, and performance evaluations of various basic data structures. The later chapters introduce common graph algorithms, various internal sorting methods, file structures, and external sorting techniques. The final chapter provides a comprehensive summary of the algorithm design techniques used throughout the book. The book features clear and concise language, rich content, a unique layout, a large number of exercises, standardized figures and tables, and consistent terminology. It is suitable as a textbook for undergraduate and junior college students in computer science and technology or related fields, as well as for distance education, correspondence courses, or self-study and professional reference.