2021 Wangdao postgraduate entrance examination data structure
Source link: Click to view the 2021 Kingway data structure
P1【2021 Edition】0.0 Course Guide
P2 [2021 version] 1.1.0 opening _ what are you learning about data structure
P3 [Version 2021] 1.1.1 Basic concepts of data structure
P4 [Version 2021] 1.2.1 Basic concepts of algorithm
P5 [2021 version] 1.2.2 Algorithm time complexity
P6 [2021 version] 1.2.3 Space complexity of the algorithm
P7 [Version 2021] 2.1_ Definition and basic operation of linear table
P8 [2021 version] 2.2.1_ definition of sequence table
P9 [Version 2021] 2.2.2_1_ Insert and delete sequence table
P10 [2021 version] 2.2.2_2_ lookup of sequence table
P11【2021 version】2.3.1_Definition of singly linked list
P12 [Version 2021] 2.3.2_1_ Insertion and deletion of singly linked lists
P13 [2021 version] 2.3.2_2_ lookup of singly linked list
P14 [Version 2021] 2.3.2_3_The establishment of a single linked list
P15【2021 version】2.3.3_Double linked list
P16【2021 version】2.3.4_Circular linked list
P17 [2021 version] 2.3.5_ static linked list
P18 [2021 version] 2.3.6_Comparison of sequence list and linked list
P19 [Version 2021] 3.1.1_ Basic concepts of stack
P20 [Version 2021] 3.1.2_The implementation of sequential storage of the stack
P21 [2021 version] 3.1.3_Chained storage implementation of stack
P22 [2021 version] 3.2.1_The basic concept of queue
P23 [2021 version] 3.2.2_ Queue implementation
P24 [Version 2021] 3.2.3_Chain implementation of queue
P25 [2021 version] 3.2.4_ deque
P26 [2021 version] 3.3.1_stack application in bracket matching
P27 [Version 2021] 3.3.2_Stack Application in Expression Evaluation (Part 1)
P28 [2021 version] 3.3.2_stack application in expression evaluation (below)
P29 [2021 version] 3.3.3_stack application in recursion
P30 [2021 version] 3.3.4_ queue application
P31 [Version 2021] 3.4_ Compressed storage of special matrix
P32 [Version 2021] 4.1_1_String definition and basic operation
P33 [2021 version] 4.1_2_ string storage structure
P34 [Version 2021] 4.2_1_ string naive pattern matching algorithm
P35 [2021 version] 4.2_2_KMP algorithm (on)
P36 [2021 version] 4.2_3_KMP algorithm (below)
P37 [2021 version] 4.2_4_KMP algorithm further optimization
P38 [Old Version] 5.1 Basic Concepts of Trees
P39 [Old Version] 5.2.1 Concept of Binary Tree
P40 [old version] 5.2.2 The storage structure of the binary tree
P41 [Old Version] 5.3.1 Traversal of Binary Tree
P42 [Old Version] 5.3.2 Cue Binary Tree
P43 [old version] 5.4.1 Tree storage structure
P44 [Old Version] 5.4.2~5.4.3 Trees and Forests
P45 [old version] 5.4.4 Tree application and check collection
P46 [Old Version] 5.5.1 Binary Sort Tree
P47 [Old Version] 5.5.2 Balanced Binary Tree
P48 [Old Version] 5.5.3 Huffman Tree
P49 [Old Version] 6.1.1 Basic Concepts of Graphs
P50 [Old Version] 6.2.1 Adjacency Matrix Method
P51 [Old Version] 6.2.2 Adjacency Table Method
P52【Old Version】6.2.3 Cross Linked List
P53 [old version] 6.2.4 Adjacent multiple tables
P54【Old version】6.2.5 Basic operation of diagram
P55 [Old Version] 6.3.1 Breadth First Search
P56 [Old Version] 6.3.2 Depth First Search
P57 [Old Version] 6.4.1 Minimum Spanning Tree
P58 [old version] 6.4.2 Shortest path
P59 [Old Version] 6.4.3 Topological Sort
P60 [Old Version] 6.4.4 Critical Path
P61 [Old Version] 7.1.1 Basic Concepts of Search
P62 [Old Version] 7.2.1 Search in order
P63 [Old Version] 7.2.2 Search by half
P64 [old version] 7.2.3 Search by block
P65 [old version] 7.3.1 B tree
P66 [old version] 7.3.2 B+ tree
P67 [Old Version] 7.4.1 Basic Concepts of Hash Table
P68 [old version] 7.4.2~7.4.4 Hash function construction method and conflict handling
P69 [Old Version] 8.1 Basic Concepts of Sorting
P70 [Old Version] 8.2.1 Direct Insertion Sort
P71 [old version] 8.2.2 Insertion sort by half
P72 [old version] 8.2.3 Hill sort
P73 [Old Version] 8.3.1 Bubble Sort
P74【Old Version】8.3.2 Quick Sort
P75【Old version】8.4.1 Direct selection and sorting
P76 [Old Version] 8.4.2 Heap Sort
P77 [Old Version] 8.5.1 Merge Sort
P78 [old version] 8.5.2 base order
P79 [Old Version] 8.6 Comparison and Application of Internal Sorting Algorithms
P80 [old version] 8.7.1~8.7.2 External sorting method
P81 [Old Version] 8.7.3 Loser Tree