Two algorithms for constructing a binary tree from its traversals
- 29 August 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (6) , 297-299
- https://doi.org/10.1016/0020-0190(88)90177-9
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Alternative methods for the reconstruction of trees from their traversalsBIT Numerical Mathematics, 1987
- Listing and counting subtrees of equal size of a binary treeInformation Processing Letters, 1983
- A numbering system for binary treesCommunications of the ACM, 1977