{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Binary Search 2","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c5bc52c93cd514ce\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare947' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/947' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"07:30","index":{"item_1":{"title":"Binary Search","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Binary Search (\u4e8c\u5206\u641c\u5c0b\u6cd5)","time":"6290","indent":"0","sn":"2"},"item_3":{"title":"Algorithm ofBinary Search","time":"7090","indent":"0","sn":"3"},"item_4":{"title":"The Height of a Binary Tree is  ","time":"130390","indent":"0","sn":"4"},"item_5":{"title":"Slide 5","time":"282440","indent":"0","sn":"5"},"item_6":{"title":"Slide 6","time":"445790","indent":"0","sn":"6"}},"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\/c\/c5bc52c93cd514ce\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c5bc52c93cd514ce\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c5bc52c93cd514ce\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/c\/c5bc52c93cd514ce","status":true}