基于遍历序列重构二叉结构树的分析  

Analysis Based On Traversal Sequence To Build Binary Tree

作　　者：朱涛[1] 

机构地区：[1]陕西理工学院数学与计算机科学学院,陕西汉中723000

出　　处：《红河学院学报》2013年第2期27-30,共4页Journal of Honghe University

摘　　要：针对如何由二叉树的遍历序列来唯一确定二叉树的问题,提出了用两种遍历序列唯一确定一棵二叉树的方法.理论分析证明,已知先序遍历和中序遍历或者已知后序遍历和中序遍历可以唯一确定一棵二叉树,但已知后序遍历和先序遍历就不能唯一确定了.文中还对用两种遍历序列唯一重构一棵二叉树算法进行了描述.An approach to confirm a unique binary tree by traversal sequence is discussed. The approach is based on confirming a unique binary tree by two kinds of traversal sequence. Theoretical analysis proved that the preorder traversed sequence and the in order traversal sequence or the post order traversal sequence and the in order traversal sequence can be used to confirm the only one binary tree. However, the post order traversal sequence and the preorder traversal sequence cannot confirm the only one binary tree. The problem has been explained in this paper.

关 键 词：遍历 遍历序列 二叉树 重构 

分 类 号：O18[理学—数学]