Pages that link to "Item:Q1198039"
From MaRDI portal
The following pages link to A note on the reconstruction of a binary tree from its traversals (Q1198039):
Displaying 10 items.
- A bounded-space tree traversal algorithm (Q689629) (← links)
- Construction of a tree from its traversals in optimal time and space (Q910183) (← links)
- Two algorithms for constructing a binary tree from its traversals (Q1111397) (← links)
- An optimal algorithm for reconstructing a binary tree (Q1198037) (← links)
- New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
- Efficient algorithms for tree reconstruction (Q1822974) (← links)
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time (Q1898217) (← links)
- Constructing a binary tree from its traversals by reversible recursion and iteration (Q2414043) (← links)
- Programming Languages and Systems (Q5902365) (← links)
- Optimal binary search trees (Q5906917) (← links)