Constructing a binary tree from its traversals by reversible recursion and iteration

DOI10.1016/J.IPL.2019.03.002zbMath1473.68214OpenAlexW2921038879WikidataQ128233133 ScholiaQ128233133MaRDI QIDQ2414043

Robert Glück, Tetsuo Yokoyama

Publication date: 10 May 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2019.03.002

zbMATH Keywords

binary treedesign of algorithmsprogram inversiontree traversalreversible algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (3)

From reversible programming languages to reversible metalanguages ⋮ Reversible computing from a programming language perspective ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Program inversion: More than fun!
• Construction of a tree from its traversals in optimal time and space
• Two algorithms for constructing a binary tree from its traversals
• Inversion of a recursive tree traversal
• Efficient reconstruction of binary trees from their transversals
• Reversible Flowchart Languages and the Structured Reversible Program Theorem
• Constructing a binary tree efficiently from its traversals
• Clean Reversible Simulations of Ranking Binary Trees

This page was built for publication: Constructing a binary tree from its traversals by reversible recursion and iteration