A note on the reconstruction of a binary tree from its traversals

DOI10.1016/0020-0190(92)90100-AzbMath0780.68057WikidataQ127216928 ScholiaQ127216928MaRDI QIDQ1198039

Priti Shankar, Naveen Gabrani

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

binary treeanalysis of algorithmsparallel algorithmtree traversalEREW PRAM modellinear-time sequential algorithmpreorder and inorder traversals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)

Related Items (2)

New algorithms for the LCA problem and the binary tree reconstruction problem ⋮ Optimal binary search trees

Cites Work

• Construction of a tree from its traversals in optimal time and space
• Listing and counting subtrees of equal size of a binary tree
• Two algorithms for constructing a binary tree from its traversals
• Parallel Prefix Computation

This page was built for publication: A note on the reconstruction of a binary tree from its traversals