欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
人们已经提出了一些由一棵二叉树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该二叉树的算法.这些算法当然适用于严格二叉树.根据基于遍历序列的唯一确定严格二叉树的方法,提出了一些新的由一棵严格二叉树的某两种遍历序列以及某种遍历序列和结点的某种信息构造该严格二叉树的算法,为构造严格二叉树提供了更多的途经.
英文摘要：
Some algorithms have been presented for constructing a binary tree from its certain two kinds of traversal,as well as its certain kind of traversal and certain information of each node.These algorithms are certainly suitable for strictly binary trees.According to the methods for uniquely determining a strictly binary tree based on its traversals,this paper presents some new algorithms for constructing 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,providing more ways for constructing strictly binary trees.
同期刊论文项目
同项目期刊论文
期刊信息
位置：