Abstract
Given the preorder traversal of a tree together with some additional structure information, the tree can be constructed in linear time with a simple algorithm. The additional information may be the inorder or postorder traversal. In one case, the binary search tree, no additional information is required. We also show how to transform the construction algorithm into a nonrecursive algorithm requiring only constant space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
