基于遍历序列的唯一确定树或二叉树的方法

基于遍历序列的唯一确定树或二叉树的方法既体现了树或二叉村的遍历序列的部分性质，又是建立树或二叉村的存储结构的主要依据，本文首先介绍了由一棵二叉树的某两种遍历序列或某种遍历序列和结点的某种信息可以唯一确定该二叉树的各种可能方法，然后分别针对树、严格二叉树与雨季叉排序树加以介绍，本文比较全面的介绍了基于遍历离列的唯一确定树或二叉树的方法，进一步完善了树或二叉树的遍历序列的性质。

METHODS FOR UNIQUELY DETERMINING A TREE OR A BINARYTREE BASED ON ITS TRAVERSAL SEQUENCES

The methods for uniquely determining a tree or a binary tree based on its traversal sequences not only embody the partial character of the traversal sequences of trees or binary trees, but also are the main basis for building the storage structures of trees or binary trees. This thesis first gives an introduction to the various kinds of possible method with which certain two kinds of traversal sequence or a certain kind of traversal sequence and certain information of the nodes of a binary tree may uniquely determine the binary tree. Then the paper gives an account of trees, strictly binary trees and binary search trees respectively. This paper fairly comprehensively presents the methods for uniquely determining a tree or a binary tree based on its traversal sequences, further perfecting the character of the traversal sequences of trees or binary trees.