Efficient reconstruction of binary trees from their transversals

DOI10.1016/0893-9659(89)90122-5zbMath0725.68079OpenAlexW1994859311MaRDI QIDQ2277867

E. A. T. Merks, R. D. Cameron, Binay K. Bhattacharya

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90122-5

zbMATH Keywords

reconstruction of binary trees

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Listing and counting subtrees of equal size of a binary tree
• Two algorithms for constructing a binary tree from its traversals

This page was built for publication: Efficient reconstruction of binary trees from their transversals