论文信息 - An Optimal Algorithm for Reconstructing a Binary Tree

An Optimal Algorithm for Reconstructing a Binary Tree

Abstract We solve the difficult part of constructing a binary tree from its inorder and preorder traversals, finding the (right-son, parent) pairs, and outline an optimal parallel algorithm in the EREW PRAM model for constructing the binary tree.

C. Pandu Rangan | V. Kamakoti

[1] Stephan Olariu,et al. An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals , 1991, ICCI.

[2] Arne Andersson,et al. Construction of a Tree From its Traversals in Optimal Time and Space , 1990, Inf. Process. Lett..

[3] Uzi Vishkin,et al. Highly parallelizable problems , 1989, STOC '89.

[4] E. Mäkinen. Constructing a binary tree from its traversals , 1989 .

[5] Gen-Huey Chen,et al. Two Algorithms for Constructing a Binary Tree from its Traversals , 1988, Inf. Process. Lett..

[6] Sushil Jajodia,et al. Alternative methods for the reconstruction of trees from their traversals , 1987, BIT Comput. Sci. Sect..