{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:28:50Z","timestamp":1725877730801},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811036132"},{"type":"electronic","value":"9789811036149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-981-10-3614-9_59","type":"book-chapter","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T00:02:41Z","timestamp":1483747361000},"page":"475-488","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Algorithm for Constructing Binary Trees Using the Traversal Sequences"],"prefix":"10.1007","author":[{"given":"Fangxiu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Huaqing","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Bosheng","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,8]]},"reference":[{"key":"59_CR1","volume-title":"Data Structure","author":"YM Yan","year":"1992","unstructured":"Yan, Y.M., Wu, W.M.: Data Structure. Tsinghua University Press, Beijing (1992)"},{"issue":"1","key":"59_CR2","first-page":"13","volume":"5","author":"LM Xiang","year":"2000","unstructured":"Xiang, L.M., Lawi, A., Ushijima, K.: On constructing a binary tree from its traversals. Res. Rep. Inf. Sci. Electr. Eng. Kyushu Univ. 5(1), 13\u201318 (2000)","journal-title":"Res. Rep. Inf. Sci. Electr. Eng. Kyushu Univ."},{"key":"59_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/00207160008804973","volume":"75","author":"E Mikinen","year":"2000","unstructured":"Mikinen, E.: Constructing a binary tree efficiently from its traversals. Int. J. Comput. Math. 75, 143\u2013147 (2000)","journal-title":"Int. J. Comput. Math."},{"key":"59_CR4","first-page":"26","volume":"27","author":"ZL Tang","year":"2011","unstructured":"Tang, Z.L.: Algorithm of constructing tree based on ergodic sequence. J. Suzhou Univ. Nat. Sci. Ed. 27, 26\u201329 (2011)","journal-title":"J. Suzhou Univ. Nat. Sci. Ed."},{"key":"59_CR5","first-page":"9","volume":"3","author":"ZL Tang","year":"2013","unstructured":"Tang, Z.L.: An efficient algorithm for constructing a strict binary tree based on the preorder traversal sequence and the left child of the node. J. Nantong Univ. Nat. Sci. Ed. 3, 9\u201313 (2013)","journal-title":"J. Nantong Univ. Nat. Sci. Ed."},{"key":"59_CR6","first-page":"93","volume":"12","author":"ZL Tang","year":"2014","unstructured":"Tang, Z.L.: A non recursive algorithm for constructing a strict binary tree by the parents of the nodes and the postorder traversal sequence. J. Nantong Vocat. Coll. 12, 93\u201398 (2014)","journal-title":"J. Nantong Vocat. Coll."},{"key":"59_CR7","first-page":"37","volume":"8","author":"L Lu","year":"2009","unstructured":"Lu, L.: A non recursive algorithm for constructing a binary tree by the traversal sequences. J. Hengshui Univ. 8, 37\u201340 (2009)","journal-title":"J. Hengshui Univ."},{"key":"59_CR8","first-page":"53","volume":"9","author":"FX Wang","year":"2013","unstructured":"Wang, F.X., Zhou, K.: Establishment of the binary tree based on the sort binary tree. J. Wuhan Polytechnic Univ. 9, 53\u201357 (2013)","journal-title":"J. Wuhan Polytechnic Univ."},{"key":"59_CR9","first-page":"53","volume":"3","author":"LS Li","year":"2010","unstructured":"Li, L.S.: An algorithm using the traversal sequences to construct a binary tree. J. Radio TV Univ. 3, 53\u201354 (2010)","journal-title":"J. Radio TV Univ."},{"key":"59_CR10","first-page":"55","volume":"24","author":"G Zhao","year":"2013","unstructured":"Zhao, G., Li, K.: Using the traversal sequences to determine the binary tree. J. Nanchang Univ. Aeronaut. Astronaut. 24, 55\u201359 (2013)","journal-title":"J. Nanchang Univ. Aeronaut. Astronaut."},{"key":"59_CR11","first-page":"27","volume":"4","author":"T Zhu","year":"2013","unstructured":"Zhu, T.: Reconstruction analysis of the binary tree based on the traversal sequences. J. Honghe Univ. 4, 27\u201330 (2013)","journal-title":"J. Honghe Univ."},{"key":"59_CR12","first-page":"268","volume":"5","author":"ZZ Hua","year":"2013","unstructured":"Hua, Z.Z.: A new method and proof for recovery of the binary tree based on the traversal sequences. J. Jiangxi Normal Univ. 5, 268\u2013272 (2013)","journal-title":"J. Jiangxi Normal Univ."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing \u2013 Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3614-9_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:32:01Z","timestamp":1498361521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3614-9_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9789811036132","9789811036149"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3614-9_59","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}