基于遍历序列的构造树的算法

摘要

Some algorithms have been presented for constructing a binary tree or a strictly binary tree from its certain two kinds of traversal, as well as its certain kind of traversal and certain information of each node. According to the methods for uniquely determining a tree based on its traversals, this paper presents some new algorithms for constructing a tree from its certain two kinds of traversal, as well as its certain kind of traversal and certain information of each node, providing more ways for constructing trees.%人们提出了一些由一棵二叉树或严格二叉树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该二叉树或严格二叉树的算法.根据基于遍历序列的唯一确定树的方法,提出一些新的由一棵树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该树的算法,为构造树提供更多的途经.