Constructing a binary tree from its traversals

DOI10.1007/BF02219241MaRDI QIDQ1822943zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

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)

Cites work

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

Cited in

(6)

• An optimal algorithm for reconstructing a binary tree
• Parallel general prefix computations with geometric, algebraic, and other applications
• Optimal binary search trees
• Constructing a binary tree from its traversals by reversible recursion and iteration
• CONSTRUCTING RED-BLACK TREE SHAPES
• Constructing a binary tree efficiently from its traversals

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

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