论文信息 - Constructing a binary tree from its traversals - 字舞流文

Constructing a binary tree from its traversals

This paper shows that a binary tree can be constructed from its preorder and inorder traversals in linear time and space.

[1] Gary D. Knott,et al. A numbering system for binary trees , 1977, CACM.

[2] Teruo Hikita. Listing and Counting Subtrees of Equal Size of a Binary Tree , 1983, Inf. Process. Lett..

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

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