Data Structures and Algorithms Zhang Ming, Peking University

This course will lead us to learn based on the idea of ​​"algorithm + data structure = program" and be guided by problem solving. I hope it can help everyone improve their theory, abstraction, and design abilities. On the basis of solid classical theory, use problem abstraction, data abstraction, and algorithm abstraction to analyze problems, and apply appropriate data structures and algorithms to design and implement corresponding programs. Through course study, your abstract thinking ability and problem-solving ability will be greatly improved, and your programming ability and code quality will make a qualitative leap!

In solving practical problems, we will learn to use data structures to organize data, design efficient algorithms, and complete high-quality programs to meet complex practical application needs by weighing the cost of time, space and other resources.

This course uses the national "Eleventh Five-Year Plan" textbook "Data Structure and Algorithm" edited by Zhang Ming (Higher Education Press). It is suitable for undergraduate students majoring in computer science and related science and engineering. It is recommended to take courses such as Introduction to Computing first, and it is best to have a basic knowledge of object-oriented programming such as C++. For students with a foundation in structured programming in C language, Chapter 0 of this course adds some basic object-oriented content.

The content learned in the course will be used in various subsequent courses in computer science, such as operating systems, software engineering, introduction to databases, compilation technology, computer graphics, human-computer interaction, etc. I hope it can lay a solid foundation for everyone to engage in computer-related learning, research and development work in the future.

• Chapter 1：Course Introduction (5 minutes and 4 seconds)

• Chapter 2：problem solving (6 minutes and 47 seconds)

• Chapter 3：What is data structure (10 minutes and 29 seconds)

• Chapter 4：algorithm (13 minutes and 5 seconds)

• Chapter 5：linear table (10 minutes and 57 seconds)

• Chapter 6：stack (16 minutes and 29 seconds)

• Chapter 7：Recursive calling principle (10 minutes and 6 seconds)

• Chapter 8：Recursive to non-recursive (16 minutes and 41 seconds)

• Chapter 9：queue (8 minutes and 12 seconds)

• Chapter 10：String basics and naive pattern matching (13 minutes and 6 seconds)

• Chapter 11：KMP fast pattern matching (16 minutes and 0 seconds)

• Chapter 12：Binary tree concept (6 minutes and 45 seconds)

• Chapter 13：Binary tree ADT and DFS (16 minutes and 51 seconds)

• Chapter 14：Binary tree BSF (4 minutes and 16 seconds)

• Chapter 15：Binary tree storage (13 minutes and 1 seconds)

• Chapter 16：binary search tree (12 minutes and 13 seconds)

• Chapter 17：Heap and priority queue (16 minutes and 4 seconds)

• Chapter 18：Huffman tree and its applications (21 minutes and 32 seconds)

• Chapter 19：The definition of trees and forests and the mapping of binary trees (11 minutes and 51 seconds)

• Chapter 20：ADT and traversal (9 minutes and 9 seconds)

• Chapter 21：chain storage (7 minutes and 40 seconds)

• Chapter 22：Parent pointer notation for trees (11 minutes and 54 seconds)

• Chapter 23：Sequential storage of trees and K-ary tree (19 minutes and 23 seconds)

• Chapter 24：diagram concept (12 minutes and 51 seconds)

• Chapter 25：Graph storage (8 minutes and 38 seconds)

• Chapter 26：Graph traversal (20 minutes and 20 seconds)

• Chapter 27：shortest path (19 minutes and 9 seconds)

• Chapter 28：minimum spanning tree (17 minutes and 42 seconds)

• Chapter 29：merge sort (14 minutes and 50 seconds)

• Chapter 30：Assignment sort (9 minutes and 51 seconds)

• Chapter 31：Radix sort (15 minutes and 35 seconds)

• Chapter 32：Radix sort (continued) (14 minutes and 32 seconds)

• Chapter 33：Index sorting (14 minutes and 2 seconds)

• Chapter 34：Algorithm performance analysis (17 minutes and 23 seconds)

• Chapter 35：File organization (15 minutes and 12 seconds)

• Chapter 36：external sorting algorithm (20 minutes and 16 seconds)

• Chapter 37：Basic concepts of search (8 minutes and 6 seconds)

• Chapter 38：Collection retrieval (12 minutes and 0 seconds)

• Chapter 39：hash function (19 minutes and 28 seconds)

• Chapter 40：Hash conflict handling (17 minutes and 29 seconds)

• Chapter 41：static index (17 minutes and 49 seconds)

• Chapter 42：Inverted index (20 minutes and 34 seconds)

• Chapter 43：B-tree (25 minutes and 34 seconds)

• Chapter 44：B+ tree (18 minutes and 16 seconds)

• Chapter 45：bit indexing technology (6 minutes and 19 seconds)

• Chapter 46：red black tree (21 minutes and 20 seconds)

• Chapter 47：Multidimensional Arrays (19 minutes and 19 seconds)

• Chapter 48：generalized table (12 minutes and 53 seconds)

• Chapter 49：Storage management (22 minutes and 5 seconds)

• Chapter 50：Trie tree (13 minutes and 39 seconds)

• Chapter 51：The concept and insertion operation of AVL tree (17 minutes and 1 seconds)

• Chapter 52：AVL tree deletion operation and performance analysis (18 minutes and 37 seconds)

• Chapter 53：spreading tree (24 minutes and 27 seconds)