Inversion of a recursive tree traversal
References (7)
- et al.
Two algorithms for constructing a binary tree from its traversals
Inform. Process. Lett.
(1988) - et al.
Program inversion: more than fun!
Sci. Comput. Programming
(1990) - et al.
Alternative methods for the reconstruction of trees from their traversals
BIT
(1987)
There are more references available in the full text version of this article.
Cited by (3)
Constructing a binary tree from its traversals by reversible recursion and iteration
2019, Information Processing LettersCitation Excerpt :Several procedures were published since this programming problem was introduced by Knuth [10], including inefficient ones [3,5]. The problem was also approached from the inverse direction in two steps [6,13] by first writing a procedure that generates the two label lists, which is easier to program and prove correct, and then inverting the traversal procedure to obtain the desired construction procedure. This letter explores a one-step approach, which involves writing the traversal procedure in a reversible programming language.
Designing an algorithmic proof of the two-squares theorem
2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Revisiting an automatic program inverter for Lisp
2005, ACM SIGPLAN Notices
Copyright © 1991 Published by Elsevier B.V.