Alternative methods for the reconstruction of trees from their traversals |
| |
| Authors: | H. A. Burgdorff S. Jajodia F. N. Springsteel Y. Zalcstein |
| |
| Affiliation: | (1) Department of Computer Science, University of Missouri — Columbia, 65211 Columbia, MO, U.S.A.;(2) Computer Science and Systems Branch, Naval Research Laboratory, Code 5594, 20375-5000 Washington, DC, U.S.A.;(3) Department of Mathematical Sciences, Memphis State University, 38152 Memphis, TN, U.S.A. |
| |
| Abstract: | It is well-known that given the inorder traversal of a binary tree's nodes, along with either one of its preorder or postorder traversals, the original binary tree can be reconstructed using a recursive algorithm. In this short note we provide a short, elegent, iterative solution to this classical problem.This research was done while the author held a Navy/ASEE Summer Faculty Research Associateship at the Naval Research Laboratory |
| |
| Keywords: | E.1 Data Structures |
| 本文献已被 SpringerLink 等数据库收录！ |
|
