Construction of a tree from its traversals in optimal time and space

DOI10.1016/0020-0190(90)90224-LzbMath0695.68014OpenAlexW2010148138MaRDI QIDQ910183

N. E. Zubov

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90224-l

zbMATH Keywords

analysis of algorithmsbinary search treetree constructiontree traversaldata struturesmultiway tree

Mathematics Subject Classification ID

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

Related Items (5)

New algorithms for the LCA problem and the binary tree reconstruction problem ⋮ CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES ⋮ Constructing a binary tree from its traversals by reversible recursion and iteration ⋮ An optimal algorithm for reconstructing a binary tree ⋮ A note on the reconstruction of a binary tree from its traversals

Cites Work

• Two algorithms for constructing a binary tree from its traversals
• Optimum binary search trees
• Multidimensional binary search trees used for associative searching

This page was built for publication: Construction of a tree from its traversals in optimal time and space