1.0Camdemy1.0http://media.usc.edu.twBFS走訪: 層層樹(Trees on the level)http://media.usc.edu.tw/user/http://media.usc.edu.tw/sysdata/doc/1/1aa9456e83ad3cf6/thumb_l.jpg360640<iframe width='720' height='405' id='ccShare687' frameborder='0' src='http://media.usc.edu.tw/media/e/687' allowfullscreen></iframe>video7204050重點0DECIMALstep<div>本題重點為Self Referential Structure</div>
<div>可參考Self Referential Data Structure in C - create a singly linked list<br /><a href="http://www.how2lab.com/programming/c/link-list1.php">http://www.how2lab.com/programming/c/link-list1.php</a></div>
<div>
<div>可參考Self Referential Data Structure in C - create an ordered singly linked list</div>
<div><a href="http://www.how2lab.com/programming/c/link-list2.php">http://www.how2lab.com/programming/c/link-list2.php</a></div>
</div>0001101:33:24Trees on the Level層層樹01Observation 1: breath first search (BFS)02Observation 2: is a binary tree completely specified03Observation 2: input constraints04Design Issue 1.1: node self-referential structure05Design Issue 1.2: how to new a node06Observation 3.1: root-to-node path07Observation 3.2: root-to-node path08Design Issue 2.1: build root-to-node path09Design Issue 2.2: build root-to-node path010Design Issue 2.1: build root-to-node path011Observation 4: dump tree level by level012Design Issue 3: dump tree level by level013Design Issue 4: parsing trees node by node014Coding Part 1: input tokens015Coding Part 2: build tree016Coding Part 3: dump tree017fs1280x720720x4041280x720http://media.usc.edu.tw/sysdata/doc/1/1aa9456e83ad3cf6/thumb.jpghttp://media.usc.edu.tw/sysdata/doc/1/1aa9456e83ad3cf6/cover.jpghttp://media.usc.edu.tw/sysdata/doc/1/1aa9456e83ad3cf6/video/thumbs/storyboard.jpghttp://media.usc.edu.tw/sysdata/doc/1/1aa9456e83ad3cf61