Abstract
Through analyzing the storage structures of tree, forest and binary tree, the recursive algorithm design ideas of converting the forest into the corresponding binary tree are introduced, and the recursive conversion algorithm description in C was given in this paper. Finally, the algorithm was evaluated from the two aspects of time complexity and space complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yan, W., Wu, W.: Data Structures(C language edition). Tsinghua University Press, Beijing (2002)
Geng, G.: Data Structure—C Language description. Xi’an Electronic Science and Technology University Press, Xi’an (2005)
Wang, M., Li, J.: Analysis of Time Efficiency in Recursion Algorithm. Journal of Weinan Teachers University 18(5), 61–62 (2003)
Wang, M.: Non-Recursive Simulation of the Recursive Algorithm for Searching the Longest Path in Binary Tree. Science Technology and Engineering 10(6), 1535–1539 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, M. (2011). The Recursive Algorithm of Converting the Forest into the Corresponding Binary Tree. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-21411-0_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21410-3
Online ISBN: 978-3-642-21411-0
eBook Packages: Computer ScienceComputer Science (R0)