[{"title":"(42个子文件1.11MB)中国大学MOOC浙江大学数据结构课程(陈越)____数据结构作业","children":[{"title":"中国大学MOOC浙江大学数据结构课程(陈越)____数据结构作业","children":[{"title":"链式表操作集","children":[{"title":"example.c <span style='color:#111;'>3.81KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>156.06KB</span>","children":null,"spread":false}],"spread":true},{"title":"二叉搜索树的操作集","children":[{"title":"example.c <span style='color:#111;'>4.87KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.84KB</span>","children":null,"spread":false}],"spread":true},{"title":"哈利·波特的考试","children":[{"title":"example.c <span style='color:#111;'>5.30KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.67KB</span>","children":null,"spread":false}],"spread":true},{"title":"排序","children":[{"title":"example.c <span style='color:#111;'>8.43KB</span>","children":null,"spread":false},{"title":"排序算法.xlsx <span style='color:#111;'>186.06KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>162.65KB</span>","children":null,"spread":false}],"spread":true},{"title":"列出连通集","children":[{"title":"example_LGraph.c <span style='color:#111;'>5.26KB</span>","children":null,"spread":false},{"title":"example_MGraph.c <span style='color:#111;'>4.82KB</span>","children":null,"spread":false},{"title":"example_MGraph.exe <span style='color:#111;'>158.33KB</span>","children":null,"spread":false},{"title":"example_LGraph.exe <span style='color:#111;'>158.31KB</span>","children":null,"spread":false}],"spread":true},{"title":"树的同构","children":[{"title":"example.c <span style='color:#111;'>2.75KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>155.46KB</span>","children":null,"spread":false}],"spread":true},{"title":"是否同一棵二叉搜索树","children":[{"title":"example.c <span style='color:#111;'>2.83KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>154.88KB</span>","children":null,"spread":false}],"spread":true},{"title":"两个有序链表序列的合并","children":[{"title":"example.c <span style='color:#111;'>2.54KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>155.76KB</span>","children":null,"spread":false}],"spread":true},{"title":"最大子序列和","children":[{"title":"example.c <span style='color:#111;'>3.41KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.54KB</span>","children":null,"spread":false}],"spread":true},{"title":"队列的基本操作","children":[{"title":"example.c <span style='color:#111;'>2.25KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>154.72KB</span>","children":null,"spread":false}],"spread":true},{"title":"RootofAVLTree","children":[{"title":"example.c <span style='color:#111;'>4.08KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>156.61KB</span>","children":null,"spread":false}],"spread":true},{"title":"README.txt <span style='color:#111;'>414B</span>","children":null,"spread":false},{"title":"Dijkstra","children":[{"title":"example.c <span style='color:#111;'>3.52KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.00KB</span>","children":null,"spread":false}],"spread":true},{"title":"堆中的路径","children":[{"title":"example.c <span style='color:#111;'>4.61KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>158.39KB</span>","children":null,"spread":false}],"spread":false},{"title":"堆的基本操作","children":[{"title":"example.c <span style='color:#111;'>3.01KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>162.57KB</span>","children":null,"spread":false}],"spread":false},{"title":"HuffmannTreeBuild","children":[{"title":"example.c <span style='color:#111;'>3.78KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.90KB</span>","children":null,"spread":false}],"spread":false},{"title":"一元多项式的乘法与加法运算","children":[{"title":"example.c <span style='color:#111;'>4.44KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.34KB</span>","children":null,"spread":false}],"spread":false},{"title":"二叉树的遍历","children":[{"title":"example.c <span style='color:#111;'>3.40KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>157.23KB</span>","children":null,"spread":false}],"spread":false},{"title":"HuffmanCodes","children":[{"title":"example.c <span style='color:#111;'>10.67KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>165.57KB</span>","children":null,"spread":false}],"spread":false},{"title":"迷宫问题","children":[{"title":"example.c <span style='color:#111;'>3.57KB</span>","children":null,"spread":false},{"title":"example.exe <span style='color:#111;'>159.31KB</span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":true}]