Constructing a binary tree efficiently from its traversals

DOI10.1080/00207160008804973zbMath0962.68139OpenAlexW2148126138MaRDI QIDQ4511613

Erkki Maekinen

Publication date: 30 October 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804973

zbMATH Keywords

binary treetree traversals

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Constructing a binary tree from its traversals by reversible recursion and iteration

Cites Work

• Generating binary trees with uniform probability
• Constructing a binary tree from its traversals