Two algorithms for constructing a binary tree from its traversals
From MaRDI portal
Publication:1111397
DOI10.1016/0020-0190(88)90177-9zbMath0658.68084MaRDI QIDQ1111397
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90177-9
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Inversion of a recursive tree traversal, An optimal algorithm for reconstructing a binary tree, A note on the reconstruction of a binary tree from its traversals