Reconstructing a binary tree from its traversals in doubly logarithmic CREW time

DOI10.1006/JPDC.1995.1075MaRDI QIDQ1898217zbMATH OpenOpenAlexFDO

Authors Stephan Olariu, Michael Overstreet, Zhaofang Wen

Publication date 24 September 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/261f15255e56c1d560be1d22353ad14c7ef58ea0

zbMATH Keywords

binary treeoptimal parallel algorithms

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• An optimal algorithm for reconstructing a binary tree
• A note on the reconstruction of a binary tree from its traversals
• Efficient algorithms for tree reconstruction
• Construction of a tree from its traversals in optimal time and space
• Parallel algorithms for tree traversals

Cited in

(8)

• An optimal algorithm for reconstructing a binary tree
• A note on the reconstruction of a binary tree from its traversals
• Time-optimal tree computations on sparse meshes
• Efficient algorithms for tree reconstruction
• Constructing a binary tree from its traversals by reversible recursion and iteration
• A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies
• Optimal binary search trees
• Time-optimal tree computations on sparse meshes

This page was built for publication: Reconstructing a binary tree from its traversals in doubly logarithmic CREW time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898217)