Efficient reconstruction of binary trees from their transversals

DOI10.1016/0893-9659(89)90122-5MaRDI QIDQ2277867zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Two algorithms for constructing a binary tree from its traversals
• A note on the reconstruction of a binary tree from its traversals
• Constructing a binary tree efficiently from its traversals
• Efficient algorithms for tree reconstruction
• An optimal algorithm for reconstructing a binary tree

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Listing and counting subtrees of equal size of a binary tree
• Two algorithms for constructing a binary tree from its traversals

Cited in

(8)

• Efficient generation of binary trees from inorder-postorder sequences
• Two algorithms for constructing a binary tree from its traversals
• A note on the reconstruction of a binary tree from its traversals
• Efficient algorithms for tree reconstruction
• Constructing a binary tree from its traversals by reversible recursion and iteration
• scientific article; zbMATH DE number 5130543 (Why is no real title available?)
• scientific article; zbMATH DE number 1380585 (Why is no real title available?)
• Rebuilding a tree from its traversals: a case study of program inversion

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

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