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

Algorithms for constructing a tree based on its traversals

作　　者：唐自立[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《苏州大学学报（自然科学版）》2011年第3期26-29,共4页Journal of Soochow University(Natural Science Edition)

摘　　要：人们提出了一些由一棵二叉树或严格二叉树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该二叉树或严格二叉树的算法.根据基于遍历序列的唯一确定树的方法,提出一些新的由一棵树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该树的算法,为构造树提供更多的途经.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.

关 键 词：算法 树 树遍历序列 树构造 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]