{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:49:29Z","timestamp":1725504569591},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387772509"},{"type":"electronic","value":"9780387772516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-77251-6_21","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T18:38:32Z","timestamp":1203964712000},"page":"187-193","source":"Crossref","is-referenced-by-count":2,"title":["Explore a New Way to Convert a Recursion Algorithm into a Non-recursion Algorithm"],"prefix":"10.1007","author":[{"given":"Yongping","family":"Gao","sequence":"first","affiliation":[]},{"given":"Fenfen","family":"Guan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"21_CR1","first-page":"33","volume":"15","author":"Changbao Shu","year":"2002","unstructured":"Changbao Shu, Zhenhai Liu, A Non-recursion Algorithm about Tower of Hanoi, Computer Development & Applications, Vol. 15, No. 11, 2002, pp. 33-34.","journal-title":"Computer Development & Applications"},{"issue":"3","key":"21_CR2","first-page":"72","volume":"25","author":"Chen Chuanhong","year":"2005","unstructured":"Chuanhong Chen, Wuying Shen, The Research and Application of Traversing Binary Tree, Journal of Xiaogan University, Vol. 25, No. 3, 2005, pp. 72-73.","journal-title":"Journal of Xiaogan University"},{"key":"21_CR3","unstructured":"Chunbao Li, Hui Zeng, Zhimin Zhang, Praxis of Program of Data Structure, The Press of Qinghua University, 2002."},{"issue":"4","key":"21_CR4","first-page":"372","volume":"27","author":"Wu Fuying","year":"2003","unstructured":"Fuying Wu, Luosheng Tan, Mingwen Wang, Nonrecursive Algorithm of Inorder Traversing Sequential Storage Full Binary, Journal of Jiangxi Normal University (Natural Sciences Edition), Vol. 27, No. 4, 2003, pp. 372-375.","journal-title":"Journal of Jiangxi Normal University (Natural Sciences Edition)"},{"key":"21_CR5","unstructured":"Naixiao Zhang, Algorithm and Data Structure, Higher Education Press, 2002."},{"key":"21_CR6","first-page":"17","volume":"2","author":"Yu Shuqun Gong","year":"2007","unstructured":"Shuqun Gong, Yu Ren, Weiwei Chen, The Front and Rear Pointer Design of Circular Queue GONG, Modem Computer, No. 2, 2007, pp. 17-20.","journal-title":"Modem Computer"},{"issue":"6","key":"21_CR7","first-page":"47","volume":"3","author":"Zhu Tao","year":"2005","unstructured":"Tao Zhu. Judging Fully Binary Tree on the Basis of Traversing Binary Tree [J]. Journal of Honghe University , Vol. 3, No. 6, 2005, pp. 47-48.","journal-title":"Journal of Honghe University"},{"issue":"3","key":"21_CR8","first-page":"3","volume":"5","author":"Tian Wanlan","year":"2003","unstructured":"Wanlan Tian, The Discussion of Inorder-traversing and Postorder-traversing Binary-tree with Recursive Algorithm, Journal of Liangshan University, Vol. 5, No. 3, 2003, pp. 3-3.","journal-title":"Journal of Liangshan University"},{"key":"21_CR9","unstructured":"Weimin Yan, Weimin Wu, Data Structure (C Language), The Press of Qinghua University, 1997."},{"issue":"1","key":"21_CR10","first-page":"40","volume":"22","author":"Guo Xiaoyun","year":"2004","unstructured":"Xiaoyun Guo, Non-recursive Simulation on Recursive Function, Journal of Xuzhou Normal University (Natural Science Edition), Vol. 22, No. 1, 2004, pp. 40-42.","journal-title":"Journal of Xuzhou Normal University (Natural Science Edition)"},{"key":"21_CR11","first-page":"24","volume":"11","author":"Gao Yongping","year":"2005","unstructured":"Yongping Gao, Shumin Zhou, Use Stack to Make the Non-recursion Algorithm of Bit Link Tree, Computer Era, No. 11, 2005, pp. 24-25.","journal-title":"Computer Era"},{"issue":"4","key":"21_CR12","first-page":"45","volume":"16","author":"Li Yuansong","year":"2003","unstructured":"Yuansong Li, New Method of Traversing Binary Tree, Journal of Sichuan University of Science & Engineering (Natural Sicence Edition), Vol. 16, No. 4, 2003, pp. 45-46.","journal-title":"Journal of Sichuan University of Science & Engineering (Natural Sicence Edition)"},{"issue":"4","key":"21_CR13","first-page":"109","volume":"21","author":"Yuan Yuli","year":"2006","unstructured":"Yuli Yuan, Ling Hu, The Teaching Analysis of Inorder Traversing Binary Tree in the Data Structure, Journal of Neijiang Teachers College, Vol. 21, No. 4, 2006, pp. 109-111.","journal-title":"Journal of Neijiang Teachers College"},{"issue":"3","key":"21_CR14","first-page":"567","volume":"24","author":"Zhu Zhenyuan","year":"2003","unstructured":"Zhenyuan Zhu, Cheng Zhu, Non-recursive Implementation of Recursive Algorithm, MiniMicro Systems, Vol. 24, No. 3, 2003, pp. 567-570.","journal-title":"MiniMicro Systems"},{"issue":"8","key":"21_CR15","first-page":"985","volume":"22","author":"Tang Zhili","year":"2001","unstructured":"Zhili Tang, Methods for uniquely determining a tree or a binary tree based on its traversal sequences, Mini-Micro Systems, Vol. 22, No. 8, 2001, pp. 985-988.","journal-title":"Mini-Micro Systems"},{"issue":"8","key":"21_CR16","first-page":"96","volume":"28","author":"Li Zhong","year":"2001","unstructured":"Zhong Li , Recursive Algorithm Transform into Non-recursive Algorithm , Computer Science, Vol. 28, No. 8, 2001, pp. 96-98.","journal-title":"Computer Science"},{"issue":"5","key":"21_CR17","first-page":"537","volume":"29","author":"Li Zhong","year":"2003","unstructured":"Zhong Li, Lin Meng, Dehui Yin, A discussion of postorder-traverse binary tree with norecursive algorithm, Journal of Southwest University for Nationalities (Natrual Science Edition), Vol. 29, No. 5, 2003, pp. 537-538.","journal-title":"Journal of Southwest University for Nationalities (Natrual Science Edition)"}],"container-title":["The International Federation for Information Processing","Computer And Computing Technologies In Agriculture, Volume I"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-77251-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T00:12:54Z","timestamp":1619655174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-77251-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387772509","9780387772516"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-77251-6_21","relation":{},"subject":[]}}