Inversion of a recursive tree traversal

DOI10.1016/0020-0190(91)90026-EzbMath0741.68051OpenAlexW2042453256MaRDI QIDQ1183407

Jan L. A. van de Snepscheut

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90026-e

zbMATH Keywords

formal semanticsrecursionconcurrencyprogram inversioninfix traversalsprefix traversal

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) General topics in the theory of software (68N01)

Related Items (1)

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

Cites Work

• Program inversion: More than fun!
• Two algorithms for constructing a binary tree from its traversals
• Unnamed Item
• Unnamed Item

This page was built for publication: Inversion of a recursive tree traversal