Constructing a binary tree from its traversals

DOI10.1007/BF02219241zbMath0679.68035OpenAlexW2087628381MaRDI QIDQ1822943

Erkki Maekinen

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219241

zbMATH Keywords

binary treetraversals

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Parallel general prefix computations with geometric, algebraic, and other applications ⋮ An optimal algorithm for reconstructing a binary tree ⋮ Optimal binary search trees ⋮ Constructing a binary tree efficiently from its traversals

Cites Work

• Listing and counting subtrees of equal size of a binary tree
• Two algorithms for constructing a binary tree from its traversals
• A numbering system for binary trees

This page was built for publication: Constructing a binary tree from its traversals