1.0Camdemy1.0http://media.usc.edu.tw二元樹的建構: 樹的重建(Tree Reconstruction)http://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/c/c6200adff57d26de/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare732' frameborder='0' src='http://media.usc.edu.tw/media/e/732' allowfullscreen></iframe>video7204051:20:08Tree Reconstruction樹的重建01Observation 1: breath first search (BFS)02Observation 2: depth first search (DFS)03Observation 3.1: left child and right sibling (DFS+BFS)04Observation 3.2: left child and right sibling (DFS+BFS)05Rule 1: the first two nodes with child link06Rule 2.1: backtrack sib via BFS07Rule 2.2: backtrack sib via BFS08Rule 3: both adjacent and ascending in DFS and BFS09Rule 4: otherwise with child link010Observation 4.1: special case 1 (descending)011Observation 4.2: special case 2 (ascending)012Design Issue 1: node structure013Design Issue 2.1: inverted index of BFS014Design Issue 2.2: inverted index of BFS015Design Issue 3: side by side must be sibling016Design Issue 4: show answer017Coding Part 1: scan BFS and DFS018Coding Part 2: reconstruction019Coding Part 3: show answer020fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/c/c6200adff57d26de/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/c/c6200adff57d26de/cover.jpghttp://media.usc.edu.tw/sysdata/doc/c/c6200adff57d26de/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/c/c6200adff57d26de1