{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"BFS\u8d70\u8a2a: \u5c64\u5c64\u6a39(Trees on the level)","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1aa9456e83ad3cf6\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare687' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/687' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"step":{"config":{"showTitle":"0","title":"\u91cd\u9ede","hideBullet":"0","listStyleType":"DECIMAL"},"items":{"item_1":{"type":"step","content":"<div>\u672c\u984c\u91cd\u9ede\u70baSelf Referential Structure<\/div>\r\n\r\n<div>\u53ef\u53c3\u8003Self 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>\r\n\r\n<div>\r\n<div>\u53ef\u53c3\u8003Self Referential Data Structure in C - create an ordered singly linked list<\/div>\r\n\r\n<div><a href=\"http:\/\/www.how2lab.com\/programming\/c\/link-list2.php\">http:\/\/www.how2lab.com\/programming\/c\/link-list2.php<\/a><\/div>\r\n<\/div>","path":"","path_l":"","path_s":"","position":"0","width":"0","height":"0","showBorder":"1","sn":"10"}}},"duration":"1:33:24","index":{"item_1":{"title":"Trees on the Level\u5c64\u5c64\u6a39","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Observation 1: breath first search (BFS)","time":"88600","indent":"0","sn":"2"},"item_3":{"title":"Observation 2: is a binary tree completely specified","time":"275100","indent":"0","sn":"3"},"item_4":{"title":"Observation 2: input constraints","time":"388350","indent":"0","sn":"4"},"item_5":{"title":"Design Issue 1.1: node self-referential structure","time":"564600","indent":"0","sn":"5"},"item_6":{"title":"Design Issue 1.2: how to new a node","time":"851800","indent":"0","sn":"6"},"item_7":{"title":"Observation 3.1: root-to-node path","time":"1148600","indent":"0","sn":"7"},"item_8":{"title":"Observation 3.2: root-to-node path","time":"1453600","indent":"0","sn":"8"},"item_9":{"title":"Design Issue 2.1: build root-to-node path","time":"1531750","indent":"0","sn":"9"},"item_10":{"title":"Design Issue 2.2: build root-to-node path","time":"1710800","indent":"0","sn":"10"},"item_11":{"title":"Design Issue 2.1: build root-to-node path","time":"1906750","indent":"0","sn":"11"},"item_12":{"title":"Observation 4: dump tree level by level","time":"1944400","indent":"0","sn":"12"},"item_13":{"title":"Design Issue 3: dump tree level by level","time":"2354600","indent":"0","sn":"13"},"item_14":{"title":"Design Issue 4: parsing trees node by node","time":"2878550","indent":"0","sn":"14"},"item_15":{"title":"Coding Part 1: input tokens","time":"3096100","indent":"0","sn":"15"},"item_16":{"title":"Coding Part 2: build tree","time":"3743800","indent":"0","sn":"16"},"item_17":{"title":"Coding Part 3: dump tree","time":"4715750","indent":"0","sn":"17"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1aa9456e83ad3cf6\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1aa9456e83ad3cf6\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1aa9456e83ad3cf6\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/1\/1aa9456e83ad3cf6","status":true}