The disadvantage of her lectures was that she was not surprised when she started the course. She could not read the course step by step, but she could indeed learn more. Top up

The disadvantage of her lectures was that she was not surprised when she started the course. She could not read the course step by step, but she could indeed learn more. [/Color] [/B]
Chapter 1 Introduction-1 (concept, logical structure, storage) http://db.pku.edu.cn/mzhang/ds/media/1_intro_LogStore.rm
Chapter 2 Introduction-2 (storage structure, ADT, algorithm features, algorithm measurement) http://db.pku.edu.cn/mzhang/ds/media/2_intro_StoreADTFunc.rm
Chapter 1 linear table, stack and queue-1 (linear table ADT and storage structure) http://db.pku.edu.cn/mzhang/ds/media/3_List_ADTStore.rm
Chapter 2 linear tables, stacks, and queues-2 (storage and Application of stacks)
Http://db.pku.edu.cn/mzhang/ds/media/4_List_Stack.rm
Chapter 3 linear table, stack, and queue-3 (stack and expression, stack and Recursion)
Http://db.pku.edu.cn/mzhang/ds/media/5_List_StackExp.rm
Chapter 4 linear tables, stacks, and queues-4 (stack and recursion, queue)
Http://db.pku.edu.cn/mzhang/ds/media/6_List_RecQueue.rm
Chapter 2 string -- 1 (string concept, ADT, simple pattern matching
Http://db.pku.edu.cn/mzhang/ds/media/7_String_ADT.rm
Chapter 2 string-2 (pattern matching, KMP algorithm) http://db.pku.edu.cn/mzhang/ds/media/8_String_KMP.rm
Chapter 2 binary tree -- 1 (the concept of Binary Tree and ADT) http://db.pku.edu.cn/mzhang/ds/media/9_BT_ADT.rm
Chapter 2 binary tree -- 2 (the travel of Binary Tree) http://db.pku.edu.cn/mzhang/ds/media/10_BT_Trav.rm
Chapter 2 binary tree -- 3 (non-recursive post-sequential travel of Binary Tree) http://db.pku.edu.cn/mzhang/ds/media/11_BT_NonRecPost.rm
Chapter 4 binary tree -- 4 (the breadth of the Binary Tree travel, binary tree implementation and threading Binary Tree) http://db.pku.edu.cn/mzhang/ds/media/12_BT_BreathThread.rm
Chapter 5 binary tree -- 5 (clues of Binary Tree) http://db.pku.edu.cn/mzhang/ds/media/15_BT_Thread.rm
Chapter 6 binary tree -- 6 (Binary Search Tree http://db.pku.edu.cn/mzhang/ds/media/16_BT_BST.rm
Chapter 7 binary tree-7 (HEAP) http://db.pku.edu.cn/mzhang/ds/media/19_BT_Heap.rm
Chapter 2 binary tree-8 (Huffman tree) http://db.pku.edu.cn/mzhang/ds/media/20_BT_Huffman.rm
Chapter 2 tree-1 (basic concepts of trees and traveling) http://db.pku.edu.cn/mzhang/ds/media/21_Tree_ADT_Trav.rm
Chapter 2 tree-2 (tree breadth travel and storage http://db.pku.edu.cn/mzhang/ds/media/22_Tree_BreathTrav_Store.rm
Chapter 3 tree-3 (sequential tree storage, with right chain first root) http://db.pku.edu.cn/mzhang/ds/media/23_Tree_Seq.rm
Chapter 4 tree-4 (hierarchy representation of the Left chain of the tree, with a degree of root, tree count) http://db.pku.edu.cn/mzhang/ds/media/24_Tree_Level_PostRoot_Counting.rm
Chapter 1 graph-1 (graph concept) http://db.pku.edu.cn/mzhang/ds/media/25_Graph_Concept.rm
Chapter 2 graph-2 (graph storage and travel http://db.pku.edu.cn/mzhang/ds/media/26_Graph_Trav.rm
Chapter 3 graph-3 (topological sorting of graphs) http://db.pku.edu.cn/mzhang/ds/media/29_Graph_TopSort.rm
Chapter 4 graph-4 (Single Source Shortest Path Dijstra algorithm) http://db.pku.edu.cn/mzhang/ds/media/30_Graph_Dijstra.rm
Chapter 5 Figure 5 (Floyd algorithm and prim algorithm of the minimum support tree)
Http://db.pku.edu.cn/mzhang/ds/media/31_Graph_FloydPrim.rm
Chapter 6 graph-6 (graph's kruskal algorithm) http://db.pku.edu.cn/mzhang/ds/media/32_Graph_Kruskal.rm

Chapter 1 inner sorting-1 (inner sorting basic concepts and insertion sorting) http://db.pku.edu.cn/mzhang/ds/media/33_Sort_ConceptIns.rm
Chapter 2 sorting-2 (Binary insertion sorting, Bubble sorting and shell sorting) http://db.pku.edu.cn/mzhang/ds/media/34_Sort_BinIns_Shell.rmhttp://db.
Sorting in Chapter 3-3 (fast sorting)
Pku.edu.cn/mzhang/ds/media/35_Sort_QS.rm
Sort in chapter 4 (merge sort) http://db.pku.edu.cn/mzhang/ds/media/36_Sort_Merge.rm
Chapter 5 sorting-5 (heap sorting, barrel sorting) http://db.pku.edu.cn/mzhang/ds/media/37_Sort_Heap_Bin.rm
Sort in Chapter 6-6 (base sort) http://db.pku.edu.cn/mzhang/ds/media/38_Sort_Radix.rm
Sorting in chapter 7 (Summary, address sorting) http://db.pku.edu.cn/mzhang/ds/media/39_40_Sort_Conclusion_Addr.rm

Chapter 2 file management and external sorting-1 (basic concepts of files) http://db.pku.edu.cn/mzhang/ds/media/41_File_Concept.rm
Chapter 2 file management and external sorting-2 (placement selection sorting, two-way merge, selection tree) http://db.pku.edu.cn/mzhang/ds/media/42_File_ReplaceSort_SelTree.rm
Chapter 3 file management and external sorting-3 (defeat tree, multi-channel merge) http://db.pku.edu.cn/mzhang/ds/media/43_File_SelTreeAlg.rm

Chapter 1 retrieval-1 (basic concepts of retrieval, sequential retrieval) http://db.pku.edu.cn/mzhang/ds/media/44_Search_Concept_Seq.rm
Chapter 2 search-2 (set search, hash function, split hash method) http://db.pku.edu.cn/mzhang/ds/media/45_Search_Set_Hash_Func_Openlink.rm
Chapter 3 search-3 (closed hash, detection algorithm) http://db.pku.edu.cn/mzhang/ds/media/46_Search_Hash_Close_Alg.rm

Chapter 2 Index-1 (basic index concept, linear index, inverted index) http://db.pku.edu.cn/mzhang/ds/media/47_Index_Conc_Seq_InvertedInd.rm
Chapter 2 Index-2 (B tree, B + tree) http://db.pku.edu.cn/mzhang/ds/media/48_Index_BTree_BPTreeIntro.rm
Chapter 2 Index-3 (B + tree, index performance analysis) http://db.pku.edu.cn/mzhang/ds/media/53_54_BP_IndexConclusion.rm
Chapter 2 advanced linear table-1 (multidimensional array, matrix, generalized table, memory management) http://db.pku.edu.cn/mzhang/ds/media/55_AdvList_Matrix_GenList_Mem.rm
Chapter 2 advanced tree structure-1 (Trie tree, best Binary Search Tree) http://db.pku.edu.cn/mzhang/ds/media/56_AdvTree_Trie_BestBST.rm
Chapter 2 advanced tree structure-2 (AVL Tree) http://db.pku.edu.cn/mzhang/ds/media/57_AdvTree_AVL.rm
Chapter 3 advanced tree structure-3 (AVL Tree efficiency, self-organizing data structure, stretching tree, Decision Tree) http://db.pku.edu.cn/mzhang/ds/media/58_AdvTree_AVLAnalysis_SpatialDS_Decision.rm