01.作業一 Binary Search Tree_Insertion_Inorder_Deletion
02.作業二 (1) 以中序後序或中序前序決定一個二元樹、(2)階層走訪
03.作業三 MST_Kruskal's and Prim's algorithms
04.作業四 Shortest Paths & Transitive Closure
05.作業五 Performance Evaluation for Sorting Algorithms
成績總覽