Constructing a binary tree efficiently from its traversals
From MaRDI portal
Recommendations
- Two algorithms for constructing a binary tree from its traversals
- Constructing a binary tree from its traversals by reversible recursion and iteration
- Construction of a tree from its traversals in optimal time and space
- An efficient method for constructing an I-tree
- Efficient Construction of Near-Optimal Binary and Multiway Search Trees
- Building Optimal Binary Search Trees from Sorted Values in O(N) Time
- A taxonomy of binary tree traversals
- Algorithms and Computation
- Succinct and I/O Efficient Data Structures for Traversal in Trees
Cites work
Cited in
(11)- Efficient generation of binary trees from inorder-postorder sequences
- Two algorithms for constructing a binary tree from its traversals
- A note on the reconstruction of a binary tree from its traversals
- Efficient reconstruction of binary trees from their transversals
- Constructing a binary tree from its traversals by reversible recursion and iteration
- scientific article; zbMATH DE number 6622715 (Why is no real title available?)
- The new design of the threaded binary trees
- Building Optimal Binary Search Trees from Sorted Values in O(N) Time
- A bounded-space tree traversal algorithm
- Construction of a tree from its traversals in optimal time and space
- A binary decision algorithm
This page was built for publication: Constructing a binary tree efficiently from its traversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511613)
