二元樹的建構: 樹的重建(Tree Reconstruction)

1:20:08,
2,064 views,
2017-05-28,
上傳者: 系統管理者,
收藏 0

1. Tree Reconstruction樹的重建
2. Observation 1: breath first search (BFS)
3. Observation 2: depth first search (DFS)
4. Observation 3.1: left child and right sibling (DFS+BFS)
5. Observation 3.2: left child and right sibling (DFS+BFS)
6. Rule 1: the first two nodes with child link
7. Rule 2.1: backtrack sib via BFS
8. Rule 2.2: backtrack sib via BFS
9. Rule 3: both adjacent and ascending in DFS and BFS
10. Rule 4: otherwise with child link
11. Observation 4.1: special case 1 (descending)
12. Observation 4.2: special case 2 (ascending)
13. Design Issue 1: node structure
14. Design Issue 2.1: inverted index of BFS
15. Design Issue 2.2: inverted index of BFS
16. Design Issue 3: side by side must be sibling
17. Design Issue 4: show answer
18. Coding Part 1: scan BFS and DFS
19. Coding Part 2: reconstruction
20. Coding Part 3: show answer

1/20

Volume

速度 :
畫質 :
播放設定

00:00/1:20:08

00:00/01:18

<< Prev Next >>
auto next
播放設定
寫筆記

1. Tree Reconstruction樹的重建
2. Observation 1: breath first search (BFS)
3. Observation 2: depth first search (DFS)
4. Observation 3.1: left child and right sibling (DFS+BFS)
5. Observation 3.2: left child and right sibling (DFS+BFS)
6. Rule 1: the first two nodes with child link
7. Rule 2.1: backtrack sib via BFS
8. Rule 2.2: backtrack sib via BFS
9. Rule 3: both adjacent and ascending in DFS and BFS
10. Rule 4: otherwise with child link
11. Observation 4.1: special case 1 (descending)
12. Observation 4.2: special case 2 (ascending)
13. Design Issue 1: node structure
14. Design Issue 2.1: inverted index of BFS
15. Design Issue 2.2: inverted index of BFS
16. Design Issue 3: side by side must be sibling
17. Design Issue 4: show answer
18. Coding Part 1: scan BFS and DFS
19. Coding Part 2: reconstruction
20. Coding Part 3: show answer

1. 第一講資料結構
1.1

指標與結構: 計算學期總平均
1.2

指標與結構: 足球場(Football Stadium)
1.3

指標: 位數積(Product of Digits)
1.4

演算法: BigO
1.5

演算法: NP
1.6

時間複雜度: 數數字(The Digit Counting Problem)
2. 第二講陣列
2.1

陣列與矩陣的定義
2.2

陣列的維度
2.3

一維陣列: 數位密碼(Digital Fortress)
2.4

一維陣列: 乘積(Product)
2.5

一維陣列: 計算大指數(Large Exponents)
2.6

二維陣列: 語言等第(Rank the Languages)
2.7

二維陣列: 二項式定理(Binomial Theorem)
2.8

二維陣列: 矩陣鏈乘積最佳化問題(Optimal Array Multiplication Sequence)
2.9

陣列與位元運算: 異世界探索(Mutant Flatworld Explorers)
2.10

指標陣列: 解碼瘋言瘋語(Decode the Mad man)
3. 第三講鏈結串列、堆壘與佇列
3.1

鏈結串列 (Linked List)
3.2

堆疊(Stack)與佇列(Queue)
3.3

鏈結佇列：團隊佇列(Team Queue)
3.4

堆疊: 矩陣鏈相乘(Matrix Chain Multiplication)
4. 第四講樹
4.1

二元樹的特性
4.2

二元樹的走訪
4.3

DFS走訪: 落葉(The Falling Leaves)
4.4

BFS走訪: 層層樹(Trees on the level)
4.5

二元樹的建構: 樹的重建(Tree Reconstruction)
4.6

多元樹的走訪: 攤平樹(Undraw the trees)
4.7

雜湊+遞迴: 四元樹(Quadtrees)
4.8

暴力回溯法: 八后問題(8 queens)
5. 第五講圖
5.1

圖（Graph）
5.2

圖走訪: 字接龍(Play on words)
6. 第六講排
6.1

排序(Sorting)
6.2

排序的演算法
6.3

heap排序法
7. 第七講尋
7.1

搜尋(Searching)
8. 第八講湊
8.1

雜湊法(Hashing)
8.2

雜湊法: 總和集(Sumsets)
9. 其他
9.1

資料結構(obsolete)
9.2

Rank the Languages(obsolete)
9.3

遞迴: 八后問題(8 queens)(obsolete)
9.4

Team Queue (Part 1)(obsolete)
9.5

清運垃圾(garbage colletion)
9.6

異世界探索-首部曲(Mutant Flatworld Explorers)
9.7

Tree Reconstruction Part-1
9.8

Tree Reconstruction Part-2
9.9

Tree Reconstruction Part-3
9.10

Tree Reconstruction Part-4
10. CPE練習題庫
10.1

UVA 327 Simple Expression (Part 1)
10.2

UVA 327 Simple Expression (Part 2)
10.3

UVA 327 Simple Expression (Part 3)
10.4

UVA 327 Simple Expression (Part 4)
10.5

UVA 327 Simple Expression (Part 5)
10.6

emi-ubuntu-0411

Prev BFS走訪: 層層樹(Trees on the level)

多元樹的走訪: 攤平樹(Undraw the trees)

訪客如要回應，請先登入

資料夾 :

資料結構

標籤 :

活動影片

發表時間 :

2017-05-28 07:36:15

觀看數 :

2,064

長度 :

1:20:08

發表人 :

系統管理者

部門 :

www

QR Code :