This book is divided into 9 chapters. Chapter 1 Overview, mainly introduces basic concepts such as data, data structures and algorithms. Chapters 2 to 6 respectively discuss basic types of data structures such as linear lists, stacks, queues, strings, arrays, generalized tables, trees, and graphs, including their logical structures, storage structures, and corresponding responses under various storage structures. algorithms, and give some application examples based on the discussion of basic operations. Chapters 7 and 8 discuss search and sorting, and introduce several commonly used search and sorting methods. Chapter 9 is a computer experiment, giving 4 complete examples, all of which were debugged in the VC++ 6.0 environment.
The basic theoretical knowledge in this book is explained from the shallower to the deeper and is easy to understand. Each chapter lists many practical examples, which can help students deepen their understanding of basic theoretical knowledge and cultivate their practical application abilities. Except for the algorithm in Chapter 9, the descriptions of algorithms and programs in other chapters are all in C-like language, which is convenient for students to understand and refer to when using the computer.
This book is suitable for teaching data structure courses in higher vocational colleges. The teaching hours are 60-70 hours. It can also be used as a reference book for computer professionals to self-study or take grade examinations.
Expand
