－第５章－
Ｐ２４４－Ｐ２６６
Left Child-Right Sibling Representation 轉 Binary
inorder traversal & preorder traversal & postorder traversal & level-order traversal
Ｐ２７４－Ｐ３０７
5.5.1 Threads
5.6.2 Max & Min heaps
insertion into heaps & deletion from heaps
5.7 binary search trees
它的definition看一下
insertion & deletion 也要注意
5.7.5 joining and splitting binary trees
5.8 selection trees
winner trees & lose trees
5.9 forests
Ｐ３１７－Ｐ３２２
看inorder traversal 跟 postorder traversal 分析畫出 binary trees
看preorder traversal 跟 inorder traversal 分析畫出 binary trees
322頁的公式無聊看看
－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－
－第６章－
Ｐ３２５－Ｐ３３６
undirected & directed graph(有向圖&無向圖)
內部的相鄰(adjacent)問題
還有其subgraphs
simple path (cycle)
Figure 6.5 connected components
6.1.3.1 Adjacency Matrix
Ｐ３４１－Ｐ３４９
6.2.1 Depth-First Search & 6.2.2 Breadth-First Search
6.2.4 Spanning Trees
Ｐ３５３－３６６
6.3.1 Kruskal's Algorithm & 6.3.2 Prim's Algorithm & 6.3.3 Sollin's Algorithm
6.4 SHORTHEST PATHS AND TRANSITIVE CLOSURE
Ｐ３７５－３８５
6.5.1 Activity-on-Vertex(AOV) Networks & 6.5.2 Activity-on-Edge(AOE) Networks
－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－
－第７章－
Ｐ４００－Ｐ４２２
7.3 QUICK SORT
Figure 7.2:Decision tree for Insertion Sort
7.5.2 Iterative Merge Sort
7.5.3 Recursive Merge Sorrt
7.6 HEAP SORT
Figure 7.9:Radix Sort example
Ｐ４５３
7.10.5 Optimal Merging of Runs
－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－
至於第９章
資料不齊全（逃～）
