论文信息 - Constructing a binary tree efficiently from its traversals

Constructing a binary tree efficiently from its traversals

In this note we streamline an earlier algorithm for constructing a binary tree from its inorder and preorder traversals. The new algorithm is conceptually simpler than the earlier algorithms and its time complexity has a smaller constant facto.

Erkki Mäkinen

[1] Donald E. Knuth. The art of computer programming: fundamental algorithms , 1969 .

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] Ben Johnsen. Generating binary trees with uniform probability , 1991, BIT Comput. Sci. Sect..

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

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