Two algorithms for constructing a binary tree from its traversals

DOI10.1016/0020-0190(88)90177-9zbMath0658.68084OpenAlexW1998478920MaRDI QIDQ1111397

S. H. Smith

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90177-9

zbMATH Keywords

binary treedata structuretree traversal

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

New algorithms for the LCA problem and the binary tree reconstruction problem ⋮ Constructing a binary tree from its traversals by reversible recursion and iteration ⋮ Construction of a tree from its traversals in optimal time and space ⋮ Parallel general prefix computations with geometric, algebraic, and other applications ⋮ Inversion of a recursive tree traversal ⋮ An optimal algorithm for reconstructing a binary tree ⋮ A note on the reconstruction of a binary tree from its traversals ⋮ Optimal binary search trees ⋮ Efficient reconstruction of binary trees from their transversals ⋮ Constructing a binary tree from its traversals

Cites Work

• Unnamed Item
• Listing and counting subtrees of equal size of a binary tree
• A numbering system for binary trees

This page was built for publication: Two algorithms for constructing a binary tree from its traversals