An optimal algorithm for reconstructing a binary tree
From MaRDI portal
Recommendations
- A note on the reconstruction of a binary tree from its traversals
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
- Efficient algorithms for tree reconstruction
- Two algorithms for constructing a binary tree from its traversals
- Construction of a tree from its traversals in optimal time and space
Cites work
Cited in
(9)- Two algorithms for constructing a binary tree from its traversals
- An optimal algorithm to reconstruct trees from additive distance data
- A note on the reconstruction of a binary tree from its traversals
- New algorithms for the LCA problem and the binary tree reconstruction problem
- Efficient algorithms for tree reconstruction
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
- Efficient reconstruction of binary trees from their transversals
- Constructing a binary tree from its traversals by reversible recursion and iteration
- Optimal binary search trees
This page was built for publication: An optimal algorithm for reconstructing a binary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198037)