Constructing a binary tree from its traversals by reversible recursion and iteration
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Constructing a binary tree from its traversals by reversible recursion and iteration. / Glück, Robert; Yokoyama, Tetsuo.
In: Information Processing Letters, Vol. 147, 2019, p. 32-37.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Constructing a binary tree from its traversals by reversible recursion and iteration
AU - Glück, Robert
AU - Yokoyama, Tetsuo
PY - 2019
Y1 - 2019
N2 - We cast two algorithms to generate the inorder and preorder of the labels of a binary tree in the context of reversible computing nearly three decades after they were first examined in the light of program inversion. The reversible traversals directly define the inverse algorithms that reconstruct the binary tree and have the same linear time and space requirements as the traversals. A reversible while-language is extended with reversible recursion-
AB - We cast two algorithms to generate the inorder and preorder of the labels of a binary tree in the context of reversible computing nearly three decades after they were first examined in the light of program inversion. The reversible traversals directly define the inverse algorithms that reconstruct the binary tree and have the same linear time and space requirements as the traversals. A reversible while-language is extended with reversible recursion-
U2 - 10.1016/j.ipl.2019.03.002
DO - 10.1016/j.ipl.2019.03.002
M3 - Journal article
VL - 147
SP - 32
EP - 37
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
ER -
ID: 215197420