[{"title":"( 26 个子文件 46.01MB ) 数据结构的ppt讲义,包含基础算法","children":[{"title":"10_Huffman_coding.pdf <span style='color:#111;'> 215.06KB </span>","children":null,"spread":false},{"title":"03_Algorithm_Analysis.pdf <span style='color:#111;'> 753.74KB </span>","children":null,"spread":false},{"title":"07_Trees.pdf <span style='color:#111;'> 2.81MB </span>","children":null,"spread":false},{"title":"05_Stack.pdf <span style='color:#111;'> 839.64KB </span>","children":null,"spread":false},{"title":"09_Heaps_and_Priority_queues.pdf <span style='color:#111;'> 3.06MB </span>","children":null,"spread":false},{"title":"08_Binary_trees.pdf <span style='color:#111;'> 1.64MB </span>","children":null,"spread":false},{"title":"18_Topological_sort.pdf <span style='color:#111;'> 1.53MB </span>","children":null,"spread":false},{"title":"00_Admininstrative_Stuff.pdf <span style='color:#111;'> 158.61KB </span>","children":null,"spread":false},{"title":"04_Linked_List.pdf <span style='color:#111;'> 2.48MB </span>","children":null,"spread":false},{"title":"12_AVL_trees.pdf <span style='color:#111;'> 9.69MB </span>","children":null,"spread":false},{"title":"01_Introduction.pdf <span style='color:#111;'> 203.36KB </span>","children":null,"spread":false},{"title":"14_Disjoint_sets.pdf <span style='color:#111;'> 2.07MB </span>","children":null,"spread":false},{"title":"02_Mathematical_background.pdf <span style='color:#111;'> 232.06KB </span>","children":null,"spread":false},{"title":"13_Hash_table.pdf <span style='color:#111;'> 2.00MB </span>","children":null,"spread":false},{"title":"Midterm_1_review.pdf <span style='color:#111;'> 2.89MB </span>","children":null,"spread":false},{"title":"17_Minimum_spanning_tree.pdf <span style='color:#111;'> 2.24MB </span>","children":null,"spread":false},{"title":"20_Sorting.pdf <span style='color:#111;'> 2.24MB </span>","children":null,"spread":false},{"title":"Parsing.pdf <span style='color:#111;'> 879.81KB </span>","children":null,"spread":false},{"title":"Grammar.pdf <span style='color:#111;'> 853.12KB </span>","children":null,"spread":false},{"title":"Midterm_2_review.pdf <span style='color:#111;'> 267.79KB </span>","children":null,"spread":false},{"title":"16_Graph_traversal.pdf <span style='color:#111;'> 3.28MB </span>","children":null,"spread":false},{"title":"19_Shortest_path.pdf <span style='color:#111;'> 4.43MB </span>","children":null,"spread":false},{"title":"11_Binary_search_trees.pdf <span style='color:#111;'> 3.12MB </span>","children":null,"spread":false},{"title":"Final_review.pdf <span style='color:#111;'> 423.12KB </span>","children":null,"spread":false},{"title":"15_Graphs.pdf <span style='color:#111;'> 1.09MB </span>","children":null,"spread":false},{"title":"06_Queue.pdf <span style='color:#111;'> 666.39KB </span>","children":null,"spread":false}],"spread":true}]